|
| |
|
|
A026819
|
|
a(n) = least k such that if 1<=h<=n then T(n,k)>=T(n,h), T given by A008284.
|
|
2
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
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
| Max{T(n, k)} for 1<=k<=n is A002569.
Sequence in context: A130535 A172471 A046155 * A137214 A081832 A034887
Adjacent sequences: A026816 A026817 A026818 * A026820 A026821 A026822
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
EXTENSIONS
| More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 20 2010
|
| |
|
|
