A384157 Irregular triangle read by rows: T(n,k) is the number of connected induced k-vertex subgraphs of the hyperoctahedral graph of dimension n >= 1 up to automorphisms of the hyperoctahedral graph; 0 <= k <= 2*n.
1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 3, 2, 2, 1, 1, 1, 1, 1, 2, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 2, 3, 3, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 2, 3, 3, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 2, 3, 3, 4, 4, 5, 4, 4, 3, 3, 2, 2, 1, 1
Offset: 1
Examples
Triangle begins: 1 | 1, 1, 0; 2 | 1, 1, 1, 1, 1; 3 | 1, 1, 1, 2, 2, 1, 1; 4 | 1, 1, 1, 2, 3, 2, 2, 1, 1; 5 | 1, 1, 1, 2, 3, 3, 3, 2, 2, 1, 1; 6 | 1, 1, 1, 2, 3, 3, 4, 3, 3, 2, 2, 1, 1; 7 | 1, 1, 1, 2, 3, 3, 4, 4, 4, 3, 3, 2, 2, 1, 1; 8 | 1, 1, 1, 2, 3, 3, 4, 4, 5, 4, 4, 3, 3, 2, 2, 1, 1; ...
Links
- Eric Weisstein's World of Mathematics, Cocktail Party Graph.
- Wikipedia, Cross-polytope
Comments