A026932 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A026932

Triangular array T read by rows: T(n,k) = number of partitions of n into an even number of parts, each <= k.

%I #10 Oct 17 2019 19:24:59

%S 0,1,1,0,1,1,1,2,3,3,0,1,2,3,3,1,2,4,5,6,6,0,2,3,5,6,7,7,1,3,6,8,10,

%T 11,12,12,0,2,5,8,10,12,13,14,14,1,3,8,12,16,18,20,21,22,22,0,3,7,13,

%U 17,21,23,25,26,27,27,1,4,11,18,25,30,34,36,38

%N Triangular array T read by rows: T(n,k) = number of partitions of n into an even number of parts, each <= k.

%F T(n, k) = Sum_{i=1..k} A026921(n, i).

%K nonn,tabl

%O 1,8

%A _Clark Kimberling_