|
Search: id:A024792
|
|
|
| A024792 |
|
Number of 8's in all partitions of n. |
|
+0
10
|
|
| 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 15, 23, 31, 44, 59, 82, 108, 146, 191, 254, 328, 429, 549, 709, 900, 1148, 1446, 1829, 2286, 2865, 3559, 4427, 5465, 6752, 8288, 10178, 12429, 15175, 18442, 22404, 27102, 32767, 39473, 47516, 57012, 68349, 81703, 97579, 116236
(list; graph; listen)
|
|
|
OFFSET
|
1,10
|
|
|
MATHEMATICA
|
<< DiscreteMath`Combinatorica`; Table[ Count[ Flatten[ Partitions[n]], 8], {n, 1, 53} ]
|
|
PROGRAM
|
(PARI) 1/prod(j=1, N3, eta(x^(j^3))); Vec(%) - Joerg Arndt (arndt(AT)jjj.de), May 03 2008
|
|
CROSSREFS
|
Cf. A066633, A024786, A024787, A024788, A024789, A024790, A024791, A024793, A024794.
Sequence in context: A101977 A024793 A116601 this_sequence A055771 A052955 A165801
Adjacent sequences: A024789 A024790 A024791 this_sequence A024793 A024794 A024795
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
