A046155 - OEIS

A046155

k that maximizes partitions of n into exactly k parts.

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; text; internal format)

OFFSET

0,5

COMMENTS

Essentially the same as A026819. - R. J. Mathar, Oct 18 2008

LINKS

Table of n, a(n) for n=0..82.

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] (* Robert G. Wilson v, Jul 20 2010 *)

CROSSREFS

A002569(n) = partitions of n into exactly a(n) parts.

Sequence in context: A373811 A373810 A375433 * A026819 A302342 A137214

Adjacent sequences: A046152 A046153 A046154 * A046156 A046157 A046158

KEYWORD

nonn

AUTHOR

David W. Wilson

STATUS

approved