|
|
A333418
|
|
Irregular triangle: T(n,k) gives the number of ways to 2-color k edges of the n-cube up to rotation and reflection, with 0 <= k <= A001787(n).
|
|
2
|
|
|
1, 1, 1, 1, 2, 1, 1, 1, 1, 4, 9, 18, 24, 30, 24, 18, 9, 4, 1, 1, 1, 1, 6, 24, 140, 604, 2596, 9143
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
Conjecture: All rows are unimodal (increasing, then decreasing).
Each row is a palindrome.
A333333 is analogous with the restriction that the colorings must be connected.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Table begins:
n\k| 0 1 2 3 4 5 6 7 8 9 10 11 12 ...
---+-------------------------------------------------------
1| 1, 1;
2| 1, 1, 2, 1, 1;
3| 1, 1, 4, 9, 18, 24, 30, 24, 18, 9, 4, 1, 1;
4| 1, 1, 6, 24, 140, 604, 2596, 9143, ...
5| 1, 1, 8, 50, 608, ...
6| 1, 1, 10, 89, ...
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|