This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A294449 #16 Apr 27 2023 15:05:07 %S A294449 1,12,93,378,471,858,1127,1398,1497,1524,1533,20338,20371,21982,22009, %T A294449 25638,25665,25692,27969,39184,39211,42398,43129,43150,48637,48730, %U A294449 48757,49014,49041,49068,49095,49864,50081,50090,50387,50414,50959,51344,52243,52454 %N A294449 a(n) = index where A088568 (or equally A294448) first reaches or exceeds n in magnitude. %C A294449 a(n) = smallest j such that |A088568(j)| >= n. %C A294449 This is closely related to the function DELTA(n) studied by Brent (2016). %H A294449 Rémy Sigrist, <a href="/A294449/b294449.txt">Table of n, a(n) for n = 1..10000</a> %H A294449 Richard P. Brent, <a href="https://maths-people.anu.edu.au/~brent/pd/Kolakoski-UNSW.pdf">Fast algorithms for the Kolakoski sequence</a>, Slides from a talk, 2016. %H A294449 Rémy Sigrist, <a href="/A294449/a294449.txt">C++ program</a> %o A294449 (C++) See Links section. %Y A294449 Cf. A000002, A088568, A294448. %Y A294449 Cf. A022327, A025503. %K A294449 nonn %O A294449 1,2 %A A294449 _N. J. A. Sloane_, Nov 22 2017 %E A294449 More terms from _Rémy Sigrist_, Dec 27 2022