|
Search: id:A118301
|
|
|
| A118301 |
|
Number of partitions of n into distinct parts with largest part congruent to n modulo 2. |
|
+0
6
|
|
| 1, 1, 1, 1, 2, 2, 2, 3, 4, 5, 6, 7, 9, 11, 13, 16, 19, 23, 27, 32, 38, 44, 52, 61, 71, 83, 96, 111, 128, 148, 170, 195, 224, 256, 293, 334, 380, 432, 491, 557, 630, 713, 805, 908, 1024, 1152, 1295, 1455, 1632, 1829, 2049, 2291, 2560, 2859, 3189, 3554, 3958, 4404
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
a(2*n) = A026838(2*n), a(2*n-1) = A026837(2*n-1);
a(n) = A000009(n) - A118302(n);
a(A118300(n)) = A118303(n)/2 = A000009(A118300(n))/2.
|
|
EXAMPLE
|
a(11) = #{11,9+2,7+4,7+3+1,5+4+2,5+3+2+1} = 6;
a(12) = #{12,10+2,8+4,8+3+1,6+5+1,6+4+2,6+3+2+1} = 7.
|
|
CROSSREFS
|
Cf. A046682.
Sequence in context: A029049 A094983 A015744 this_sequence A018121 A111212 A102240
Adjacent sequences: A118298 A118299 A118300 this_sequence A118302 A118303 A118304
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 22 2006
|
|
|
Search completed in 0.003 seconds
|
