A264032 Triangle read by rows: T(n,k) (n>=0, k>=n+1) is the number of integer partitions of n containing exactly k partitions.

1, 1, 2, 2, 1, 2, 1, 2, 2, 0, 0, 4, 1, 2, 0, 0, 2, 2, 2, 2, 1, 2, 0, 0, 0, 0, 2, 2, 2, 4, 1, 0, 2, 2, 0, 0, 0, 0, 0, 4, 0, 0, 4, 3, 0, 2, 2, 2, 2, 0, 1, 2, 0, 0, 0, 0, 0, 0, 2, 0, 0, 3, 2, 4, 0, 0, 4, 1, 0, 4, 2, 2, 0, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 2, 4, 2, 0, 0, 2, 2, 4, 0, 0, 6, 2, 0, 4

Offset: 0

Author

Christian Stump, Nov 01 2015

Keywords

• nonn
• tabf

Comments

Row sums give A000041.

Examples

			Triangle begins:
1,
1,
2,
2,1,
2,1,2,
2,0,0,4,1,
2,0,0,2,2,2,2,1,
2,0,0,0,0,2,2,2,4,1,0,2,
2,0,0,0,0,0,4,0,0,4,3,0,2,2,2,2,0,1,
2,0,0,0,0,0,0,2,0,0,3,2,4,0,0,4,1,0,4,2,2,0,2,2,
...
		

Links

• FindStat - Combinatorial Statistic Finder, The number of partitions contained in the given partition.

Crossrefs

Cf. A000041.