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-1 of 1 results.

A348251 Numbers that take more than the minimum number of steps to appear in A307730.

Original entry on oeis.org

6, 12, 14, 15, 21, 24, 26, 36, 38, 39, 45, 56, 57, 58, 63, 65, 72, 74, 78, 85, 86, 87, 90, 91, 99, 106, 110, 111, 115, 119, 122, 126, 129, 132, 135, 138, 142, 143, 145, 150, 158, 159, 161, 165, 171, 174, 175, 176, 178, 183, 185, 187, 190, 202, 203, 209, 213, 214, 215, 216, 220, 222, 226, 230, 231
Offset: 1

Views

Author

N. J. A. Sloane, Oct 21 2021

Keywords

Comments

The total number of appearances of a number n in A307730 is required to be n. For the numbers listed here, those appearances are spread out over more than n terms of A307730.
These are the numbers n for which A348250(n) is nonzero.
It would be nice to have an independent characterization of these numbers. It is a theorem that no primes can appear, but what more can be said? The graph is roughly linear, and the first differences are small but irregular.

Links

Crossrefs

Cf. A307720, A307730, A348246, A348249, A348409, A348250.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.