The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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.