Square array T(m,n) with m (row) >= 1 and n (column) >= 0 read by antidiagonals: number of subsets of {1,2,3,...n} that sum to 0 mod m (including the empty set, whose sum is 0).
A068009
Square array T(m,n) with m (row) >= 1 and n (column) >= 0 read by antidiagonals: number of subsets of {1,2,3,...n} that sum to 0 mod m (including the empty set, whose sum is 0).
Terms
- a(0) =1a(1) =2a(2) =1a(3) =4a(4) =1a(5) =1a(6) =8a(7) =2a(8) =1a(9) =1a(10) =16a(11) =4a(12) =2a(13) =1a(14) =1a(15) =32a(16) =8a(17) =4a(18) =1a(19) =1a(20) =1a(21) =64a(22) =16a(23) =6a(24) =2a(25) =1a(26) =1a(27) =1a(28) =128a(29) =32
External references
- oeis: A068009