This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A066261 #15 Jun 28 2015 23:48:19
%S A066261 1,16,24,256,64,384,36,4096,576,1024,32,6144,96,576,1536,65536,36,
%T A066261 9216,48,16384,864,512,256,98304,4096,1536,13824,9216,144,24576,128,
%U A066261 1048576,768,576,2304,147456,54,768,2304,262144,40,13824,384,8192,36864,4096
%N A066261 a(n) = A066260(A066260(n)).
%C A066261 Completely multiplicative since A066260 is (iterates of completely multiplicative functions are too). - _David W. Wilson_, Jun 09 2005
%H A066261 Harry J. Smith, <a href="/A066261/b066261.txt">Table of n, a(n) for n = 1..1000</a>
%H A066261 <a href="/index/Di#divseq">Index to divisibility sequences</a>
%o A066261 (PARI) Composite(n) = local(k); k=n + primepi(n) + 1; while (k != n + primepi(k) + 1, k = n + primepi(k) + 1); return(k)
%o A066261 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
%K A066261 nonn,mult
%O A066261 1,2
%A A066261 _Reinhard Zumkeller_, Dec 10 2001