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

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

Offset

10,3

Comments

The leading zeros are omitted.

Links

Table of n, a(n) for n=10..31.

Crossrefs

Cf. A007908, A366393 (largest).

Sequence in context: A134962 A267257 A113589 * A135463 A000042 A002275

Adjacent sequences: A366391 A366392 A366393 * A366395 A366396 A366397

Keyword

nonn,base,easy

Author

Stefano Spezia, Oct 08 2023

Status

approved