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



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A334303 Numbers n such that the Thue chromatic number of graph C_n is equal to 4. 0
5, 7, 9, 10, 11, 14, 17 (list; graph; refs; listen; history; text; internal format)



The Thue chromatic number of a graph G is the least number k such that there is a nonrepetitive coloring of length k, and no such coloring exists of length < k. (A coloring is nonrepetitive iff there is no path of even length such that the colors in the first half are in the same sequence as the colors in the second half.)

The Thue chromatic number of C_n for any other n > 2 is equal to 3.


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

J. D. Currie, There are ternary circular square-free words of length n for n >= 18, Elect. J. Combinatorics 9 (2002), Note #N10, 7 pp.

J. Grytczuk, Nonrepetitive colorings of graphs - a survey, Int. J. Math. Math. Sci. (2007), Art. ID 74639, 10 pp.


5 is in the sequence because you need at least four colors to make an non-repetitive coloring of C_5.


Sequence in context: A275718 A129270 A153031 * A184110 A138892 A190202

Adjacent sequences:  A334300 A334301 A334302 * A334304 A334305 A334306




Bartlomiej Pawlik, Apr 22 2020



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 June 18 04:41 EDT 2021. Contains 345098 sequences. (Running on oeis4.)