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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A201219 a(1) = 0; for n>1, a(n) = 1 if n is a power of 2, otherwise a(n) = 2. 2
 0, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS This solves the Emissary puzzle. LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 Puzzles Column, Emissary, Fall 2011, page 9, puzzle 6. FORMULA a(1) = 0, for n > 1, a(n) = 2 - A209229(n). - Antti Karttunen, Nov 19 2017 MATHEMATICA Join[{0}, Table[If[IntegerQ[Log2[n]], 1, 2], {n, 2, 200}]] (* Harvey P. Dale, Dec 03 2021 *) CROSSREFS Cf. A043529, A209229. Sequence in context: A229904 A160242 A043529 * A254315 A080942 A099812 Adjacent sequences:  A201216 A201217 A201218 * A201220 A201221 A201222 KEYWORD nonn,changed AUTHOR N. J. A. Sloane, Nov 28 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.

Last modified December 7 12:17 EST 2021. Contains 349581 sequences. (Running on oeis4.)