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.

A366394 a(n) is the smallest number that can be obtained by deleting n digits from A007908(n).

Original entry on oeis.org

0, 1, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111, 1111111110, 11111111021, 111111102122, 1111110212223, 11111021222324, 111102122232425, 1110212223242526, 11021222324252627, 102122232425262728, 212223242526272829, 1222324252627282930, 12232425262728293031
Offset: 10

Views

Author

Stefano Spezia, Oct 08 2023

Keywords

Comments

The leading zeros are omitted.

Crossrefs

Cf. A007908, A366393 (largest).
Showing 1-1 of 1 results.