|
Search: id:A157046
|
|
|
| A157046 |
|
Maximum number of partitions of n into exactly k parts, each <= k. a(n) is maximum in each row of A157044. |
|
+0
3
|
|
| 1, 1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 12, 16, 19, 24, 31, 37, 46, 58, 70, 86, 104, 127, 156, 185, 222, 273, 326, 392, 463, 556, 669, 792, 939, 1109, 1317, 1564, 1838, 2156, 2535, 2986, 3514, 4100, 4777, 5577, 6526, 7621, 8847, 10251, 11869, 13807, 16032, 18529, 21370
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
Without the constraint on each part being <=k: see A008284 and A002569.
|
|
EXAMPLE
|
For n=9 the counts of partitions for k=1..9 is 0,0,1,4,5,3,2,1,1 so the maximum is 5 (at k=5).
|
|
MATHEMATICA
|
Max @@@ Table[T[n, k, k]-T[n, k-1, k], {n, 1, 128}, {k, n}] with T[n, a, b] as defined in A047993.
|
|
CROSSREFS
|
A157044, A157046, A047993, A008284, A002569
Sequence in context: A117409 A092833 A100926 this_sequence A017979 A140881 A063827
Adjacent sequences: A157043 A157044 A157045 this_sequence A157047 A157048 A157049
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Wouter Meeussen (wouter.meeussen(AT)pandora.be), Feb 22 2009
|
|
|
Search completed in 0.002 seconds
|
