|
Search: id:A006827
|
|
|
| A006827 |
|
Number of partitions of 2n with all subsums different from n.
(Formerly M1351)
|
|
+0
2
|
|
| 1, 2, 5, 8, 17, 24, 46, 64, 107, 147, 242, 302, 488, 629, 922, 1172, 1745, 2108, 3104, 3737, 5232, 6419, 8988, 10390, 14552, 17292, 23160, 27206, 36975, 41945, 57058, 65291, 85895, 99384, 130443, 145283, 193554, 218947, 281860, 316326, 413322
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
P. Erdos, J. L. Nicolas and A. Sarkozy, On the number of partitions of n without a given subsum (I), Discrete Math., 75 (1989), 155-166 = Annals Discrete Math. Vol. 43, Graph Theory and Combinatorics 1988, ed. B. Bollobas.
|
|
CROSSREFS
|
Cf. A046663.
Sequence in context: A071085 A055236 A103041 this_sequence A062318 A112346 A034445
Adjacent sequences: A006824 A006825 A006826 this_sequence A006828 A006829 A006830
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Don Reble (djr(AT)nk.ca), Nov 03 2001
|
|
|
Search completed in 0.002 seconds
|
