|
Search: id:A036469
|
|
| |
|
| 1, 2, 3, 5, 7, 10, 14, 19, 25, 33, 43, 55, 70, 88, 110, 137, 169, 207, 253, 307, 371, 447, 536, 640, 762, 904, 1069, 1261, 1483, 1739, 2035, 2375, 2765, 3213, 3725, 4310, 4978, 5738, 6602, 7584, 8697, 9957, 11383, 12993, 14809, 16857, 19161
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Also number of 1's in all partitions of n+1 into odd parts. Example: a(4)=7 because the partitions of 5 into odd parts are [5], [3,1,1], [1,1,1,1,1], having a total number of 7 1's. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 29 2006
|
|
LINKS
|
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 774
|
|
FORMULA
|
G.f.=1/[(1-x)product(1-x^(2j-1), j=1..infinity)]. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 29 2006
|
|
MAPLE
|
g:=1/(1-x)/product(1-x^(2*j-1), j=1..30): gser:=series(g, x=0, 50): seq(coeff(gser, x, n), n=0..46); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 29 2006
|
|
CROSSREFS
|
Cf. A000009.
Sequence in context: A025488 A088585 A008581 this_sequence A116480 A023026 A096778
Adjacent sequences: A036466 A036467 A036468 this_sequence A036470 A036471 A036472
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
