A366393 - OEIS

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

(list; graph; refs; listen; history; text; internal format)

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