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.

A379059 Index of n in A377091, or -1 if n does not appear there.

Original entry on oeis.org

0, 1, 2, 5, 6, 7, 10, 11, 12, 22, 23, 24, 25, 21, 33, 34, 35, 36, 32, 46, 45, 44, 48, 47, 52, 43, 49, 50, 51, 64, 63, 62, 61, 65, 66, 67, 68, 69, 70, 71, 72, 73, 82, 83, 84, 85, 86, 87, 88, 89, 90, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 188
Offset: 0

Views

Author

N. J. A. Sloane, Dec 26 2024

Keywords

Comments

It is conjectured that every integer appears in A377091.
Conjecture 1: For n >= 10, |a(n) - 2*n| < 2*sqrt(n); for n >= 1000, |a(n) - 2*n| < 1.59*sqrt(n) (compare A379786). - N. J. A. Sloane, Jan 19 2025
Conjecture 2: lim sup |a(n) - 2*n|/sqrt(n) = sqrt(2) as n -> oo. - N. J. A. Sloane and Paolo Xausa, Feb 02 2025

Crossrefs