|
%I #2 Mar 30 2012 18:57:06
%S 1,1,2,2,2,3,3,4,4,5,5,6,6,6,7,7,9,10,10,10,11,11,13,14,14,14,14,15,
%T 15,19,20,21,21,21,21,22,22,26,28,29,29,29,29,29,30,30,37,39,40,41,41,
%U 41,41,41,42,42,50,53,54,55,55,55,55,55,55,56,56,68,72,74,75,76,76,76,76
%N Triangular array T(n,k)=number of partitions of n in which the least part is <=k, for 1<=k<=n, n>=1.
%C The partition sequence A000041 occurs here as T(n,0) and also essentially as T(n,n).
%F Row n of T consists of the partial sums of row n of the array in A026794.
%e The first five rows:
%e 1
%e 1 2
%e 2 2 3
%e 3 4 4 5
%e 5 6 6 6 7
%e Row 5 of A026794, namely 5 1 0 0 1, has partial sums 5 6 6 6 7.
%Y Cf. A000041, A026794.
%K nonn,tabl
%O 1,3
%A _Clark Kimberling_, Oct 08 2005
|
