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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185436 The minimum number of colors required to color an n-bead bracelet so that each bead can be uniquely identified by its color and the color(s) of its two immediately-adjacent 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 3-symbol strings where reversing the string doesn't matter.

LINKS

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

Problem 2 of the 1984 Canadian Mathematics Olympiad

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

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 December 9 22:27 EST 2019. Contains 329880 sequences. (Running on oeis4.)