Triangle: a(n,k) = number of partitions of n whose xor-sum is k.

A050314

Triangle: a(n,k) = number of partitions of n whose xor-sum is k.

Terms

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

External references