|
| |
|
|
A046155
|
|
k that maximizes partitions of n into exactly k parts.
|
|
1
| |
|
|
0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,5
|
|
|
COMMENTS
| Essentially the same as A026819. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 18 2008]
|
|
|
MATHEMATICA
| f[n_] := Block[{k = 1, mk = mx = 0}, While[k < n + 1, a = Length@ IntegerPartitions[n, {k}]; If[a > mx, mx = a; mk = k]; k++ ]; mk]; Array[f, 85] [From Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 20 2010]
|
|
|
CROSSREFS
| A002569(n) = partitions of n into exactly a(n) parts.
Sequence in context: A122651 A130535 A172471 * A026819 A137214 A081832
Adjacent sequences: A046152 A046153 A046154 * A046156 A046157 A046158
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Dave Wilson
|
| |
|
|
