T(n,k) = number of subsets of {1,..., n} containing exactly k squares, triangle read by rows, 0<=k<n.
A089886
T(n,k) = number of subsets of {1,..., n} containing exactly k squares, triangle read by rows, 0<=k<n.
Terms
- a(0) =1a(1) =2a(2) =2a(3) =4a(4) =4a(5) =0a(6) =4a(7) =8a(8) =4a(9) =0a(10) =8a(11) =16a(12) =8a(13) =0a(14) =0a(15) =16a(16) =32a(17) =16a(18) =0a(19) =0a(20) =0a(21) =32a(22) =64a(23) =32a(24) =0a(25) =0a(26) =0a(27) =0a(28) =64a(29) =128
External references
- oeis: A089886