This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A026819 #8 Jul 13 2015 22:39:56
%S A026819 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,
%T A026819 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 A026819 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
%N A026819 a(n) = least k such that if 1<=h<=n then T(n,k)>=T(n,h), T given by A008284.
%t A026819 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 A026819 Max{T(n, k)} for 1<=k<=n is A002569.
%K A026819 nonn
%O A026819 1,4
%A A026819 _Clark Kimberling_
%E A026819 More terms from _Robert G. Wilson v_, Jul 20 2010