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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156728 a(n) = abs(A054354(n)). 3
1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
This sequence is the image of the Kolakoski sequence A000002 under the morphism 1->1, 2->01. [Gabriele Fici, Aug 12 2013]
LINKS
J.M. Fedou and G. Fici, Some remarks on differentiable sequences and recursivity, Journal of Integer Sequences 13(3): Article 10.3.2 (2010). [From Jean-Marc Fedou and Gabriele Fici, Mar 18 2010]
FORMULA
a(n) = (v(n+1) - v(n) + 1)/2 where v(n) = A156253(n) - A156251(n).
a(n) = (A000002(n) + A000002(n+1)) mod 2.
MATHEMATICA
a2 = {1, 2, 2}; Do[ a2 = Join[a2, {1 + Mod[n - 1, 2]}], {n, 3, 105}, {i, 1, a2[[n]]}]; a[n_] := Mod[a2[[n]] + a2[[n + 1]], 2]; Table[a[n], {n, 1, 105}] (* Jean-François Alcover, Jun 18 2013 *)
CROSSREFS
Sequence in context: A285625 A283966 A054354 * A361023 A267442 A267129
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Feb 14 2009
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 14 13:51 EDT 2024. Contains 374318 sequences. (Running on oeis4.)