%I #10 Jul 19 2015 00:36:15

%S 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,

%T 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,

%U 12,13,13,13,13,13,13,13,13,14,14,14,14,14,14,14,15,15,15,15,15,15,15,15

%N k that maximizes partitions of n into exactly k parts.

%C Essentially the same as A026819. - _R. J. Mathar_, Oct 18 2008

%t 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 *)

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

%K nonn

%O 0,5

%A _David W. Wilson_