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

A027185

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

Terms

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

External references