|
| |
|
|
A066260
|
|
In the prime factorization of n replace the k-th prime by the k-th composite number, k > 0.
|
|
3
| |
|
|
1, 4, 6, 16, 8, 24, 9, 64, 36, 32, 10, 96, 12, 36, 48, 256, 14, 144, 15, 128, 54, 40, 16, 384, 64, 48, 216, 144, 18, 192, 20, 1024, 60, 56, 72, 576, 21, 60, 72, 512, 22, 216, 24, 160, 288, 64, 25, 1536, 81, 256, 84, 192, 26, 864, 80, 576, 90, 72, 27, 768, 28, 80, 324
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
|
FORMULA
| Multiplicative with a(p) = A002808(A049084(p)), p prime.
|
|
|
EXAMPLE
| a(10) = a(2*5) = a(prime(1)*prime(3)) = a(prime(1))*a(prime(3)) = comp(1)*comp(3) = 4 * 8 = 32.
|
|
|
PROG
| (PARI) Composite(n) = { local(k); k=n + primepi(n) + 1; while (k != n + primepi(k) + 1, k = n + primepi(k) + 1); return(k) } { for (n=1, 1000, f=factor(n); a=1; for (i=1, matsize(f)[1], a*=Composite(primepi(f[i, 1]))^f[i, 2]); write("b066260.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 07 2010]
|
|
|
CROSSREFS
| Cf. A066261, A066262.
Sequence in context: A191311 A086714 A009463 * A141042 A123667 A129597
Adjacent sequences: A066257 A066258 A066259 * A066261 A066262 A066263
|
|
|
KEYWORD
| mult,nonn
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 10 2001
|
| |
|
|
