A066261 a(n) = A066260(A066260(n)).

1, 16, 24, 256, 64, 384, 36, 4096, 576, 1024, 32, 6144, 96, 576, 1536, 65536, 36, 9216, 48, 16384, 864, 512, 256, 98304, 4096, 1536, 13824, 9216, 144, 24576, 128, 1048576, 768, 576, 2304, 147456, 54, 768, 2304, 262144, 40, 13824, 384, 8192, 36864, 4096

Offset: 1

Author

Reinhard Zumkeller, Dec 10 2001

Keywords

• nonn
• mult

Comments

Completely multiplicative since A066260 is (iterates of completely multiplicative functions are too). - David W. Wilson, Jun 09 2005

Links

• Harry J. Smith, Table of n, a(n) for n = 1..1000
• Index to divisibility sequences

Programs

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]); f=factor(a); a=1; for (i=1, matsize(f)[1], a*=Composite(primepi(f[i, 1]))^f[i, 2]); write("b066261.txt", n, " ", a) ) \\ Harry J. Smith, Feb 07 2010