The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 27 16:21 EST 2024. Contains 370378 sequences. (Running on oeis4.)