|
Search: id:A001402
|
|
|
| A001402 |
|
Number of partitions of n into at most 6 parts.
(Formerly M0662 N0243)
|
|
+0
5
|
|
| 1, 1, 2, 3, 5, 7, 11, 14, 20, 26, 35, 44, 58, 71, 90, 110, 136, 163, 199, 235, 282, 331, 391, 454, 532, 612, 709, 811, 931, 1057, 1206, 1360, 1540, 1729, 1945, 2172, 2432, 2702, 3009, 3331, 3692, 4070, 4494, 4935, 5427, 5942, 6510, 7104, 7760, 8442, 9192
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
A. Cayley, Calculation of the minimum N.G.F. of the binary seventhic, Collected Mathematical Papers. Vols. 1-13, Cambridge Univ. Press, London, 1889-1897, Vol. 10, p. 408-419.
H. Gupta et al., Tables of Partitions. Royal Society Mathematical Tables, Vol. 4, Cambridge Univ. Press, 1958, p. 2.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 355
|
|
FORMULA
|
a(n)=1+(a(n-2)+a(n-3)+a(n-4))-(2*a(n-7)+2*a(n-8)+a(n-9))+(a(n-11)+2*a(n-12)+2*a(n-13))- (a(n-16)+a(n-17)+a(n-18))+(a(n-20)) - Norman J. Meluch (norm(AT)iss.gm.com), Mar 09 2000
|
|
MAPLE
|
with(combstruct):ZL7:=[S, {S=Set(Cycle(Z, card<7))}, unlabeled]: seq(count(ZL7, size=n), n=0..50); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Sep 24 2007
|
|
MATHEMATICA
|
CoefficientList[ Series[ 1/((1 - x)*(1 - x^2)*(1 - x^3)*(1 - x^4)*(1 - x^5)*(1 - x^6)), {x, 0, 60} ], x ]
|
|
CROSSREFS
|
Essentially same as A026812.
a(n)=A008284(n+6, 6), n >= 0.
Adjacent sequences: A001399 A001400 A001401 this_sequence A001403 A001404 A001405
Sequence in context: A036608 A136185 A026812 this_sequence A008629 A070289 A035961
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
