A264032 - OEIS

%I #5 Nov 25 2015 21:34:03

%S 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,

%T 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,

%U 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

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

%C Row sums give A000041.

%H FindStat - Combinatorial Statistic Finder, <a href="http://www.findstat.org/StatisticsDatabase/St000108">The number of partitions contained in the given partition</a>.

%e Triangle begins:

%e 1,

%e 1,

%e 2,

%e 2,1,

%e 2,1,2,

%e 2,0,0,4,1,

%e 2,0,0,2,2,2,2,1,

%e 2,0,0,0,0,2,2,2,4,1,0,2,

%e 2,0,0,0,0,0,4,0,0,4,3,0,2,2,2,2,0,1,

%e 2,0,0,0,0,0,0,2,0,0,3,2,4,0,0,4,1,0,4,2,2,0,2,2,

%e ...

%Y Cf. A000041.

%K nonn,tabf

%O 0,3

%A _Christian Stump_, Nov 01 2015