Triangle read by rows: T(n,k) is the number of ways of choosing a k-dimensional cube from the vertices of an n-dimensional hypercube; 0 <= k <= n.
A346905
Triangle read by rows: T(n,k) is the number of ways of choosing a k-dimensional cube from the vertices of an n-dimensional hypercube; 0 <= k <= n.
Terms
- a(0) =1a(1) =2a(2) =1a(3) =4a(4) =6a(5) =1a(6) =8a(7) =28a(8) =6a(9) =1a(10) =16a(11) =120a(12) =36a(13) =8a(14) =1a(15) =32a(16) =496a(17) =200a(18) =40a(19) =10a(20) =1a(21) =64a(22) =2016a(23) =1120a(24) =280a(25) =60a(26) =12a(27) =1a(28) =128a(29) =8128
External references
- oeis: A346905