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.

1, 1, 3, 1, 5, 7, 1, 9, 13, 15, 1, 17, 25, 29, 31, 1, 33, 49, 57, 61, 63, 1, 65

Offset

1,3

Links

Table of n, a(n) for n=1..23.

Jens-P. Bode, Heiko Harborth, Meinhard Möller, and Hauke Nienborg, Vertex rainbow numbers for cube graphs, Congressus Numerant., 203 (2010), 167-174.

Workshop, Cycles and Colourings 2010, P. J. Šafárik University. See pp. 2-3.

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 89-97 113 121 125 127
  ...

Crossrefs

Sequence in context: A216182 A143524 A134249 * A265707 A360965 A336301

Adjacent sequences: A188506 A188507 A188508 * A188510 A188511 A188512

Keyword

nonn,tabl,more

Author

N. J. A. Sloane, Apr 14 2011

Status

approved