|
Search: id:A117930
|
|
|
| A117930 |
|
Number of partitions of 2n into factorial parts (0! not allowed, i.e. only one kind of 1 can be a part). Also number of partitions of 2n+1 into factorial parts. |
|
+0
1
|
|
| 1, 2, 3, 5, 7, 9, 12, 15, 18, 22, 26, 30, 36, 42, 48, 56, 64, 72, 82, 92, 102, 114, 126, 138, 153, 168, 183, 201, 219, 237, 258, 279, 300, 324, 348, 372, 400, 428, 456, 488, 520, 552, 588, 624, 660, 700, 740, 780, 825, 870, 915, 965, 1015, 1065, 1120, 1175, 1230
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n)=A064986(2n)=A064986(2n+1). The first 48 terms of this sequence agree with those of A090632.
|
|
FORMULA
|
G.f.=1/[(1-x)*product(1-x^(j!/2)], j=2..infinity).
|
|
EXAMPLE
|
a(3)=5 because the partitions of 6 into factorials are [6],[2,2,2],[2,2,1,1],[2,1,1,1,1], and [1,1,1,1,1,1].
|
|
MAPLE
|
g:=1/(1-x)/product(1-x^(j!/2), j=2..7): gser:=series(g, x=0, 70): seq(coeff(gser, x, n), n=0..65);
|
|
CROSSREFS
|
Cf. A064986, A090632.
Sequence in context: A130206 A022794 A025693 this_sequence A090632 A022786 A005704
Adjacent sequences: A117927 A117928 A117929 this_sequence A117931 A117932 A117933
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 04 2006
|
|
|
Search completed in 0.002 seconds
|
