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 A098395 #18 Jul 03 2022 04:57:14
%S A098395 1,10,11,12,20,21,22,23,30,31,32,33,34,40,41,42,43,44,45,50,51,52,53,
%T A098395 54,55,56,60,61,62,63,64,65,66,67,70,71,72,73,74,75,76,77,78,80,81,82,
%U A098395 83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,109,119,129,139,149
%N A098395 a(n) is the next larger integer including the highest digit of a(n-1), a(1) = 1.
%F A098395 a(n) = A011539(n - 44) for n >= 53. - _David A. Corneth_, Jul 11 2020
%e A098395 a(10) = 31 which has the largest digit (in base 10) 3. So a(11) must contain a 3 and be larger than 31. The least positive integer with these properties is 32. So a(10 + 1) = a(11) = 1. - _David A. Corneth_, Jul 11 2020
%t A098395 nli[n_]:=Module[{x=Max[IntegerDigits[n]],k=n+1},While[FreeQ[ IntegerDigits[ k],x],k++];k]; NestList[nli,1,70] (* _Harvey P. Dale_, Jul 11 2020 *)
%Y A098395 Cf. A011539.
%K A098395 nonn,base,easy
%O A098395 1,2
%A A098395 _Eric Angelini_, Oct 26 2004
%E A098395 Name corrected by _David A. Corneth_, Jul 11 2020