Triangle read by rows: T(n,k) is the number of subsets of {0..2^n-1} with k elements such that the bitwise-xor of all the subset members gives zero, 0 <= k <= 2^n.
A340312
Triangle read by rows: T(n,k) is the number of subsets of {0..2^n-1} with k elements such that the bitwise-xor of all the subset members gives zero, 0 <= k <= 2^n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =0a(5) =1a(6) =1a(7) =0a(8) =1a(9) =1a(10) =1a(11) =1a(12) =0a(13) =7a(14) =14a(15) =7a(16) =0a(17) =1a(18) =1a(19) =1a(20) =1a(21) =0a(22) =35a(23) =140a(24) =273a(25) =448a(26) =715a(27) =870a(28) =715a(29) =448
External references
- oeis: A340312