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.

A376779 The terms of A329447 sorted into increasing order.

Original entry on oeis.org

0, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 33, 34, 35, 36, 37, 38, 39, 40, 44, 45, 46, 47, 48, 49, 50, 55, 56, 57, 58, 59, 60, 66, 67, 68, 69, 70, 77, 78, 79, 80, 88, 89, 90, 99, 100, 112, 113, 114, 115, 116, 117, 118, 119, 120, 123, 124, 125, 126, 127, 128, 129, 130, 134, 135, 136, 137, 138, 139, 140, 145, 146, 147, 148
Offset: 1

Views

Author

N. J. A. Sloane, Nov 11 2024

Keywords

Comments

Is there an independent characterization of these numbers? The following seems like a promising attack. Let the sequence {b(n)} be obtained by deleting the right-most digit of each a(n). Then for k from 1 though 10, k appears 11-k times in {b(n)}, and the numbers 10*k+i missing from {a(n)} correspond to i = 1,2,...,k-1.

Crossrefs

Cf. A329447.