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 A120001 #17 Sep 07 2022 08:13:37 %S A120001 0,10,12,21,102,112,123,213,312,412,512,612,712,812,912,1012,1023, %T A120001 1123,1213,1234,1324,1423,2113,2134,3124,4123,5123,6123,7123,8123, %U A120001 9123,10123,10234,11213,11234,12134,12345,13245,14235,15234,16234,17234,18234,19234,21134,21345 %N A120001 Where record values of A119999 occur. %C A120001 A120000(n)=A119999(a(n)) and A119999(m) < A120000(n) for m<a(n); %C A120001 problem: smallest m>1023456789 such that A119999(m)>A119999(1023456789)? %C A120001 From _David A. Corneth_, Sep 07 2022: (Start) %C A120001 Does every term >= 10 contain the digit 1? %C A120001 Does every term >= 12 contain the digits 1 and 2? %C A120001 Does every term >= 1023 contain the digits 1, 2 and 3? %C A120001 Does every term >= 11234 contain the digits 1, 2, 3 and 4? %C A120001 Does every term >= 112345 contain the digits 1, 2, 3, 4 and 5? (End) %H A120001 David A. Corneth, <a href="/A120001/b120001.txt">Table of n, a(n) for n = 1..51</a> %e A120001 21 is in the sequence as A119999(21) = 12 and 12 is the largest value of A119999(k) for k in [0, 21]. - _David A. Corneth_, Sep 07 2022 %Y A120001 Cf. A001399, A001400, A004526, A119999, A120000. %K A120001 nonn,base %O A120001 1,2 %A A120001 _Reinhard Zumkeller_, Jun 13 2006 %E A120001 More terms from _David A. Corneth_, Sep 07 2022