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

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A156253 Least k such that A054353(k)>=n 13
 1, 2, 2, 3, 3, 4, 5, 6, 6, 7, 8, 8, 9, 9, 10, 11, 11, 12, 12, 13, 14, 15, 15, 16, 17, 18, 18, 19, 19, 20, 21, 21, 22, 23, 24, 24, 25, 26, 26, 27, 27, 28, 29, 30, 30, 31, 32, 33, 33, 34, 35, 35, 36, 36, 37, 38, 38, 39, 39, 40, 41, 42, 42, 43, 44, 44, 45, 45, 46, 47, 47, 48, 49, 50 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n)=1 plus the number of symbol changes in the first n terms of A000002. [From Jean-Marc Fedou and Gabriele Fici, Mar 18 2010] Comment from N. J. A. Sloane, Nov 12 2018 (Start) This seems to be A001462 rewritten so the run lengths are given by A000002. The companion sequence, A000002 rewritten so the run lengths are given by A001462, is A321020. Note that Kolakoski's sequence A000002 and Golomb's sequence A001462 have very similar definitions, although the asymptotic behavior of A001462 is well-understood, while that of A000002 is a mystery. The asymptotic behavior of the two hybrids A156253 and A321020 might be worth investigating. (End) 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). N. J. A. Sloane, Coordination Sequences, Planing Numbers, and Other Recent Sequences (II), Experimental Mathematics Seminar, Rutgers University, Jan 31 2019, Part I, Part 2, Slides. (Mentions this sequence) FORMULA Conjecture: a(n) should be asymptotic to 2n/3. Length of n-th run of the sequence = A000002(n) [From Benoit Cloitre, Feb 19 2009] MATHEMATICA a2 = {1, 2, 2}; Do[ a2 = Join[a2, {1 + Mod[n - 1, 2]}], {n, 3, 80}, {i, 1, a2[[n]]}]; a3 = Accumulate[a2]; a[1] = 1; a[n_] := a[n] = For[k = a[n - 1], True, k++, If[a3[[k]] >= n, Return[k]]]; Table[a[n], {n, 1, 80}] (* Jean-François Alcover, Jun 18 2013 *) CROSSREFS Cf. A000002, A001462, A054353, A321020. Sequence in context: A062298 A283371 A116579 * A265436 A060151 A285902 Adjacent sequences:  A156250 A156251 A156252 * A156254 A156255 A156256 KEYWORD nonn AUTHOR Benoit Cloitre, Feb 07 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 2 10:39 EST 2020. Contains 338876 sequences. (Running on oeis4.)