

A188509


Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) is the maximal number of colors in a vertex coloring of the cube graph Q_n such that no subgraph Q_k is a rainbow.


0



1, 1, 3, 1, 5, 7, 1, 9, 13, 15, 1, 17, 25, 29, 31, 1, 33, 49, 57, 61, 63, 1, 65
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


LINKS



EXAMPLE

Triangle begins:
1
1 3
1 5 7
1 9 13 15
1 17 25 29 31
1 33 49 57 61 63
1 65 8997 113 121 125 127
...


CROSSREFS



KEYWORD



AUTHOR



STATUS

approved



