|
|
2, 8, 6, 24, 10, 24, 14, 64, 18, 40, 22, 72, 26, 56, 30, 160, 34, 72, 38, 120, 42, 88, 46, 192, 50, 104, 54, 168, 58, 120, 62, 384, 66, 136, 70, 216, 74, 152, 78, 320, 82, 168, 86, 264, 90, 184, 94, 480, 98, 200, 102, 312, 106, 216, 110, 448, 114, 232, 118, 360, 122
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Table of n, a(n) for n=1..61.
R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
|
|
|
FORMULA
|
a(n) = n*A001511(n) = A001511(A000312(n))
G.f. sum(k>=0, 2^(k+1)*x^2^k/(1-x^2^k)^2). - Ralf Stephan, Jun 07 2003
a(n) = 2*n*A001511(n) = 2*A001511(A000312(n)).
|
|
|
MATHEMATICA
|
Table[ Part[ Flatten[ FactorInteger[n^n]], 2], {n, 2, 124, 2}]
|
|
|
CROSSREFS
|
Cf. A001511, A007814, A000312.
Sequence in context: A019243 A100871 A111860 * A085590 A079538 A098221
Adjacent sequences: A069892 A069893 A069894 * A069896 A069897 A069898
|
|
|
KEYWORD
|
easy,nonn
|
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Apr 10 2002
|
|
|
STATUS
|
approved
|
|
