The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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
 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 EXAMPLE Triangle T{n,k} begins: 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; ... CROSSREFS Cf. A001400 (row sums), A219237, A233292 (row partial sums). Sequence in context: A026921 A198568 A327310 * A157044 A182748 A025879 Adjacent sequences:  A232536 A232537 A232538 * A232540 A232541 A232542 KEYWORD nonn,tabl AUTHOR L. Edson Jeffery, Jan 02 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 21 23:00 EST 2020. Contains 332113 sequences. (Running on oeis4.)