|
|
A005705
|
|
Number of partitions of 4*n into powers of 4.
(Formerly M0552)
|
|
9
|
|
|
1, 2, 3, 4, 6, 8, 10, 12, 15, 18, 21, 24, 28, 32, 36, 40, 46, 52, 58, 64, 72, 80, 88, 96, 106, 116, 126, 136, 148, 160, 172, 184, 199, 214, 229, 244, 262, 280, 298, 316, 337, 358, 379, 400, 424, 448, 472, 496, 524, 552, 580, 608, 640, 672, 704, 736, 772, 808, 844
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Also number of partitions of 4*n+k into powers of 4 where k=1,2,3. - Michael Somos, Mar 15 2020
|
|
REFERENCES
|
R. K. Guy, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
a(n) = a(n-1) + a(floor(n/4)).
G.f.: T(x)=(1-x)^(-1)/(Product_{k>=0} 1-x^(4^k)), it satisfies T(x)=(1-x^4)/(1-x)^2*T(x^4). - Joerg Arndt, May 12 2010
|
|
MATHEMATICA
|
Fold[Append[#1, Total[Take[Flatten[Transpose[Table[#1, {4}]]], #2]]] &, {1}, Range[2, 20]] (* Birkas Gyorgy, Apr 18 2011 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|