cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A022327 Least k such that the first k terms of the Kolakoski sequence (A000002) contain n more 1's than 2's.

Original entry on oeis.org

1, 32, 257, 798, 825, 858, 1127, 1398, 1497, 1524, 1533, 193140, 193173, 194036, 194045, 195378, 196371, 196380, 198571, 198634, 199149, 199554, 199861, 200286, 201759, 201786, 201795, 205330, 205687, 205714, 205807, 206032, 206065, 206092
Offset: 1

Views

Author

Keywords

Crossrefs

Cf. A025503 (2's over 1's).

A294449 a(n) = index where A088568 (or equally A294448) first reaches or exceeds n in magnitude.

Original entry on oeis.org

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
Offset: 1

Views

Author

N. J. A. Sloane, Nov 22 2017

Keywords

Comments

a(n) = smallest j such that |A088568(j)| >= n.
This is closely related to the function DELTA(n) studied by Brent (2016).

Crossrefs

Extensions

More terms from Rémy Sigrist, Dec 27 2022
Showing 1-2 of 2 results.