

A185436


The minimum number of colors required to color an nbead bracelet so that each bead can be uniquely identified by its color and the color(s) of its two immediatelyadjacent neighbors.


1



1, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

I am not sure whether or not this sequence is just the biggest number k for which A002411(k) is less than or equal to n. Clearly that forms a lower bound, since it is the number of 3symbol strings where reversing the string doesn't matter.


LINKS

Table of n, a(n) for n=1..19.
Canadian Mathematics Olympiad, Problem 2, 1984.
MathLearning.org, Solution [gives A185437]


EXAMPLE

For example, the string AABABBBCCC colors a bracelet of 10 beads using 3 symbols. No two beads have the same color and neighbors with the same set of colors. In this problem, the order in which the neighbors' colors occur doesn't matter (because the bracelet can be turned over). So the string ABBABCBCAC wouldn't work, because we can't distinguish between the second and third beads (ABB and BBA). We can't do this with only 2 colors, so a(10) = 3.


CROSSREFS

Cf. A185437, A002411
Sequence in context: A065682 A065681 A121242 * A025794 A025793 A102680
Adjacent sequences: A185433 A185434 A185435 * A185437 A185438 A185439


KEYWORD

nonn,more


AUTHOR

Jack W Grahl, Jan 27 2011


EXTENSIONS

Definition and example changed (per a comment by Wouter Meeussen) to refer to the ring of beads using the term "bracelet," rather than "necklace," since turning the ring over is allowed.  Jon E. Schoenfield, Sep 18 2013


STATUS

approved



