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.
%I A366393 #11 Oct 09 2023 12:53:58 %S A366393 9,91,912,9213,92314,931415,9341516,94151617,945161718,9516171819, %T A366393 95617181920,961718192021,9671819202122,97181920212223, %U A366393 978192021222324,9819202122232425,98920212223242526,992021222324252627,9922122232425262728,99222223242526272829,992222324252627282930 %N A366393 a(n) is the largest number that can be obtained by deleting n digits from A007908(n). %C A366393 Inspired by the Example 1.1 at pp. 1-2 in Andreescu and Feng (see References). %D A366393 Titu Andreescu and Zuming Feng, A Path to Combinatorics for Undergraduates: Counting Strategies, Birkhäuser, Boston, 2004. %F A366393 a(n) mod 10^A055642(n) = n, for n > 11. %Y A366393 Cf. A007908, A011557, A055642, A366394 (smallest). %K A366393 nonn,base,easy %O A366393 10,1 %A A366393 _Stefano Spezia_, Oct 08 2023