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!)
A294449 a(n) = index where A088568 (or equally A294448) first reaches or exceeds n in magnitude. 3
1, 12, 93, 378, 471, 858, 1127, 1398, 1497, 1524, 1533, 20338, 20371, 21982, 22009, 25638, 25665, 25692, 27969, 39184, 39211, 42398, 43129, 43150, 48637, 48730, 48757, 49014, 49041, 49068, 49095, 49864, 50081, 50090, 50387, 50414, 50959, 51344, 52243, 52454 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) = smallest j such that |A088568(j)| >= n.
This is closely related to the function DELTA(n) studied by Brent (2016).
LINKS
Richard P. Brent, Fast algorithms for the Kolakoski sequence, Slides from a talk, 2016.
Rémy Sigrist, C++ program
PROG
(C++) See Links section.
CROSSREFS
Sequence in context: A044263 A044644 A173348 * A073913 A057410 A045894
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Nov 22 2017
EXTENSIONS
More terms from Rémy Sigrist, Dec 27 2022
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 April 18 11:52 EDT 2024. Contains 371779 sequences. (Running on oeis4.)