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.

A194799 Triangle read by rows: T(n,k) = number of partitions of n that are formed by k sections, k >= 1.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 4, 2, 2, 1, 1, 1, 4, 4, 2, 2, 1, 1, 1, 7, 4, 4, 2, 2, 1, 1, 1, 8, 7, 4, 4, 2, 2, 1, 1, 1, 12, 8, 7, 4, 4, 2, 2, 1, 1, 1, 14, 12, 8, 7, 4, 4, 2, 2, 1, 1, 1, 21, 14, 12, 8, 7, 4, 4, 2, 2, 1, 1, 1, 24, 21, 14
Offset: 1

Views

Author

Omar E. Pol, Jan 30 2012

Keywords

Comments

Also triangle read by rows in which row n lists the first k terms of A187219 in reverse order. For more information see A135010.

Examples

			Triangle begins:
1,
1,1,
1,1,1,
2,1,1,1,
2,2,1,1,1,
4,2,2,1,1,1,
4,4,2,2,1,1,1,
7,4,4,2,2,1,1,1,
8,7,4,4,2,2,1,1,1,
12,8,7,4,4,2,2,1,1,1,
14,12,8,7,4,4,2,2,1,1,1,
21,14,12,8,7,4,4,2,2,1,1,1
		

Crossrefs

Columns are A187219. Row sums give A000041, n >= 1.