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

9, 91, 912, 9213, 92314, 931415, 9341516, 94151617, 945161718, 9516171819, 95617181920, 961718192021, 9671819202122, 97181920212223, 978192021222324, 9819202122232425, 98920212223242526, 992021222324252627, 9922122232425262728, 99222223242526272829, 992222324252627282930

Offset

10,1

Comments

Inspired by the Example 1.1 at pp. 1-2 in Andreescu and Feng (see References).

References

Titu Andreescu and Zuming Feng, A Path to Combinatorics for Undergraduates: Counting Strategies, Birkhäuser, Boston, 2004.

Links

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

Formula

a(n) mod 10^A055642(n) = n, for n > 11.

Crossrefs

Cf. A007908, A011557, A055642, A366394 (smallest).

Sequence in context: A217959 A014992 A015585 * A242299 A109108 A163456

Adjacent sequences: A366390 A366391 A366392 * A366394 A366395 A366396

Keyword

nonn,base,easy

Author

Stefano Spezia, Oct 08 2023

Status

approved