login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

REFERENCES

J.-P. Bode et al., Vertex rainbow numbers for cube graphs, Congressus Numerant., 203 (2010), 167-174.

LINKS

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

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 A188146 A001607

Adjacent sequences:  A188506 A188507 A188508 * A188510 A188511 A188512

KEYWORD

nonn,tabl,more

AUTHOR

N. J. A. Sloane, Apr 14 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 18 09:38 EST 2019. Contains 320249 sequences. (Running on oeis4.)