|
%I #16 Apr 27 2023 15:05:07
%S 1,12,93,378,471,858,1127,1398,1497,1524,1533,20338,20371,21982,22009,
%T 25638,25665,25692,27969,39184,39211,42398,43129,43150,48637,48730,
%U 48757,49014,49041,49068,49095,49864,50081,50090,50387,50414,50959,51344,52243,52454
%N a(n) = index where A088568 (or equally A294448) first reaches or exceeds n in magnitude.
%C a(n) = smallest j such that |A088568(j)| >= n.
%C This is closely related to the function DELTA(n) studied by Brent (2016).
%H Rémy Sigrist, <a href="/A294449/b294449.txt">Table of n, a(n) for n = 1..10000</a>
%H 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 Rémy Sigrist, <a href="/A294449/a294449.txt">C++ program</a>
%o (C++) See Links section.
%Y Cf. A000002, A088568, A294448.
%Y Cf. A022327, A025503.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Nov 22 2017
%E More terms from _Rémy Sigrist_, Dec 27 2022
|
