A232539 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A232539

Triangle read by rows: T(n,k) = number of partitions of n into at most four parts in which the largest part is equal to k, 0 <= k <= n.

1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 1, 0, 0, 2, 2, 1, 1, 0, 0, 2, 3, 2, 1, 1, 0, 0, 1, 3, 3, 2, 1, 1, 0, 0, 1, 3, 4, 3, 2, 1, 1, 0, 0, 0, 3, 4, 4, 3, 2, 1, 1, 0, 0, 0, 2, 5, 5, 4, 3, 2, 1, 1, 0, 0, 0, 1, 4, 6, 5, 4, 3, 2, 1, 1, 0, 0, 0, 1, 4, 6, 7, 5, 4, 3, 2, 1, 1

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

0,13

LINKS

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

EXAMPLE

Triangle T{n,k} begins:

0, 1;

0, 1, 1;

0, 1, 1, 1;

0, 1, 2, 1, 1;

0, 0, 2, 2, 1, 1;