|
|
A002569
|
|
Max_{k=0..n} { Number of partitions of n into exactly k parts }.
(Formerly M0283 N0101)
|
|
7
|
|
|
1, 1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 11, 15, 18, 23, 30, 37, 47, 58, 71, 90, 110, 136, 164, 201, 248, 300, 364, 436, 525, 638, 764, 919, 1090, 1297, 1549, 1845, 2194, 2592, 3060, 3590, 4242, 5013, 5888, 6912, 8070, 9418, 11004, 12866, 15021, 17475, 20298, 23501, 27169
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
REFERENCES
|
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
MAPLE
|
1, seq(max(seq(combinat:-numbpart(n, k)-combinat:-numbpart(n, k-1), k=1..n)), n=1..100); # Robert Israel, Nov 24 2014
|
|
MATHEMATICA
|
f[n_] := Block[{k = 1, mx = 0}, While[k < n + 1, a = Length@ IntegerPartitions[n, {k}]; If[a > mx, mx = a]; k++ ]; mx]; Array[f, 53] (* Robert G. Wilson v, Jul 20 2010 *)
t[0, k_] := 1; t[1, k_] := 1 /; k > 0; t[n_, k_] := 0 /; n < 0; t[n_, 0] := 0 /; n > 0; t[n_, 1] := 1 /; n > 0; t[n_, k_] := t[n, k] = Sum[t[n - k + i, k - i], {i, 0, k - 1}];
f[n_] := Max[ Table[ t[n - k, k], {k, 0, n}]]; Array[f, 54, 0] (* Robert G. Wilson v, Nov 24 2014 *)
Max[CoefficientList[#, a]] & /@ (1/QPochhammer[a q, q] + O[q]^60)[[3]] (* Vladimir Reshetnikov, Nov 17 2016 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|