|
Search: id:A077071
|
|
| |
|
| 0, 2, 8, 16, 30, 46, 66, 88, 118, 150, 186, 224, 268, 314, 364, 416, 478, 542, 610, 680, 756, 834, 916, 1000, 1092, 1186, 1284, 1384, 1490, 1598, 1710, 1824, 1950, 2078, 2210, 2344, 2484, 2626, 2772, 2920, 3076, 3234, 3396, 3560, 3730, 3902, 4078, 4256
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
R. Stephan, Some divide-and-conquer sequences ...
R. Stephan, Table of generating functions
|
|
FORMULA
|
a(n) is asymptotic to 2*n^2 and it seems that a(n) = 2*n^2 + O(n^(3/2)) (where O(n^(3/2))/n^(3/2) is bounded and O(n^(3/2)) <0 ) - Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 30 2002
G.f. 1/(1-x)^2 * sum(k>=0, t/(1-t), t=x^2^k). Twice the value of the partial sum of A005187. a(0) = 0, a(2n) = a(n)+a(n-1)+4n^2+2n, a(2n+1)=2a(n)+4n^2+6n+2. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 12 2003
|
|
PROGRAM
|
(PARI) a(n)=sum(k=0, n, -valuation(polcoeff(pollegendre(2*n), 2*k), 2))
|
|
CROSSREFS
|
Cf. A077070.
Adjacent sequences: A077068 A077069 A077070 this_sequence A077072 A077073 A077074
Sequence in context: A125259 A137882 A136514 this_sequence A077666 A096227 A134353
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Michael Somos Oct 25, 2002
|
|
|
Search completed in 0.002 seconds
|
