This site is supported by donations to The OEIS Foundation.

 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!)
 A284369 Fixed point of the morphism 0->1, 1->1001. 3
 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1 COMMENTS Let u(n) = # 0's <= n and v(n) = # 1's <= n.  Let r = (3+sqrt(3))/2 and s = sqrt(3), so that 1/r + 1/s = 1.  Conjecture:  -3 <  n*r - u(n) < 4 and -2 < n*s - v(n) < 3 for n >= 1. LINKS Clark Kimberling, Table of n, a(n) for n = 1..31647 EXAMPLE 1->1001-> 1001111001-> MATHEMATICA s = Nest[Flatten[# /. {0 -> {1}, 1 -> {1, 0, 0, 1}}] &, {0}, 15]; (* A284369 *) Flatten[Position[s, 0]];  (* A284370 *) Flatten[Position[s, 1]];  (* A284371 *) CROSSREFS Cf. A284370, A284371. Sequence in context: A072770 A071674 A090172 * A194661 A285427 A285621 Adjacent sequences:  A284366 A284367 A284368 * A284370 A284371 A284372 KEYWORD nonn,easy AUTHOR Clark Kimberling, Mar 26 2017 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 11 07:37 EST 2019. Contains 329914 sequences. (Running on oeis4.)