|
Search: id:A046663
|
|
|
| A046663 |
|
Triangle: T(n,k) = number of partitions of n (>=2) with no subsum equal to k (1 <= k <= n-1). |
|
+0
2
|
|
| 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 4, 3, 5, 3, 4, 4, 4, 4, 4, 4, 4, 7, 5, 7, 8, 7, 5, 7, 8, 7, 7, 8, 8, 7, 7, 8, 12, 9, 12, 9, 17, 9, 12, 9, 12, 14, 11, 12, 12, 13, 13, 12, 12, 11, 14, 21, 15, 19, 15, 21, 24, 21, 15, 19, 15, 21, 24, 19, 20, 19, 21, 22, 22, 21, 19, 20, 19, 24, 34
(list; table; graph; listen)
|
|
|
OFFSET
|
2,4
|
|
|
REFERENCES
|
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.
|
|
EXAMPLE
|
For n = 4 there are two partitions (4, 2+2) with no subsum equal to 1, two (4, 3+1) with no subsum equal to 2 and two (4, 2+2) with no subsum equal to 3.
1; 1,1; 2,2,2; 2,2,2,2; 4,3,5,3,4; ...
|
|
CROSSREFS
|
Cf. A006827.
Sequence in context: A029393 A109703 A103375 this_sequence A064132 A166594 A105267
Adjacent sequences: A046660 A046661 A046662 this_sequence A046664 A046665 A046666
|
|
KEYWORD
|
nonn,easy,nice,tabl
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Corrected and extended by Don Reble (djr(AT)nk.ca), Nov 04, 2001
|
|
|
Search completed in 0.002 seconds
|
