|
%I #21 Feb 24 2022 08:45:48
%S 1,0,1,0,1,2,0,1,2,3,0,1,3,4,5,0,0,2,4,5,6,0,0,2,5,7,8,9,0,0,1,4,7,9,
%T 10,11,0,0,1,4,8,11,13,14,15,0,0,0,3,7,11,14,16,17,18,0,0,0,2,7,12,16,
%U 19,21,22,23,0,0,0,1,5,11,16,20,23,25,26,27,0,0,0,1,5,11,18,23,27,30,32,33,34
%N Triangle read by rows: T(n,k) is the number of partitions of n into at most four parts in which no part exceeds k, 0 <= k <= n.
%C Transpose of table A219237.
%F T(n,k) = Sum_{j=0..k} A232539(n,j).
%e Triangle T(n,k) begins:
%e 1;
%e 0, 1;
%e 0, 1, 2;
%e 0, 1, 2, 3;
%e 0, 1, 3, 4, 5;
%e 0, 0, 2, 4, 5, 6;
%e 0, 0, 2, 5, 7, 8, 9;
%e 0, 0, 1, 4, 7, 9, 10, 11;
%e 0, 0, 1, 4, 8, 11, 13, 14, 15; ...
%Y Cf. A001400 (main diagonal), A219237, A232539.
%K nonn,tabl
%O 0,6
%A _L. Edson Jeffery_, Jan 02 2014
|
