Triangular array O by rows: O(n,k) = number of partitions of n into an odd number of parts, the greatest being k.

A026920

Triangular array O by rows: O(n,k) = number of partitions of n into an odd number of parts, the greatest being k.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =1a(4) =0a(5) =1a(6) =0a(7) =1a(8) =0a(9) =1a(10) =1a(11) =1a(12) =1a(13) =0a(14) =1a(15) =0a(16) =2a(17) =1a(18) =1a(19) =0a(20) =1a(21) =1a(22) =1a(23) =3a(24) =1a(25) =1a(26) =0a(27) =1a(28) =0a(29) =2

External references