

A233292


Triangle read by rows: T(n,k) = number of partitions of n into at most four parts in which no part exceeds k, 0 <= k <= n.


1



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, 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, 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
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,6


COMMENTS

Transpose of table A219237.


LINKS

Table of n, a(n) for n=0..90.


FORMULA

T(n,k) = sum_{k=1..n} A232539(n,k).


EXAMPLE

Triangle T(n,k) begins:
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, 10, 11;
0, 0, 1, 4, 8, 11, 13, 14, 15; ...


CROSSREFS

Cf. A001400 (main diagonal), A219237, A232539.
Sequence in context: A293377 A159880 A289251 * A108456 A089107 A321449
Adjacent sequences: A233289 A233290 A233291 * A233293 A233294 A233295


KEYWORD

nonn,tabl


AUTHOR

L. Edson Jeffery, Jan 02 2014


STATUS

approved



