A026819 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A026819

a(n) = least k such that if 1<=h<=n then T(n,k)>=T(n,h), T given by A008284.

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, 16

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

LINKS

Table of n, a(n) for n=1..83.

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

Max{T(n, k)} for 1<=k<=n is A002569.

Sequence in context: A373810 A375433 A046155 * A302342 A137214 A284726

Adjacent sequences: A026816 A026817 A026818 * A026820 A026821 A026822

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

More terms from Robert G. Wilson v, Jul 20 2010

STATUS

approved