cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A194438 Triangle read by rows: T(n,k) is the number of regions of the set of partitions of n into k parts.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 1, 1, 0, 1, 3, 1, 1, 0, 1, 0, 1, 5, 2, 1, 0, 1, 0, 1, 0, 0, 0, 1, 7, 3, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 11, 4, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 15, 6, 1, 2, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0
Offset: 1

Views

Author

Omar E. Pol, Nov 28 2011

Keywords

Comments

For the definition of "region" see A206437. See also A186114 and A193870. - Omar E. Pol, May 21 2021

Examples

			Triangle begins:
   1;
   1,1;
   1,1,1;
   2,1,1,0,1;
   3,1,1,0,1,0,1;
   5,2,1,0,1,0,1,0,0,0,1;
   7,3,1,0,1,0,1,0,0,0,1,0,0,0,1;
  11,4,1,1,1,0,1,0,0,0,1,0,0,0,1,0,0,0,0,0,0,1;
...
		

Crossrefs

Column 1 is A194439.
Row n has length A000041(n).
Row sums give A000041, n >= 1.

Extensions

Definition clarified by Omar E. Pol, May 21 2021