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 A252480 #15 May 10 2020 15:54:46 %S A252480 100,101,102,103,104,105,106,107,108,109,200,201,202,203,204,205,206, %T A252480 207,208,209,300,301,302,303,304,305,306,307,308,309,400,401,402,403, %U A252480 404,405,406,407,408,409,500,501,502,503,504,505,506,507,508,509,600,601,602,603,604,605,606 %N A252480 Numbers whose decimal representation has at least one '0' digit in a position other than the final digit. %C A252480 Similar but different sequences are the "Cyclops numbers" A134808 and A032945 and A051022, which are subsequences, except for the 1- and 2-digit terms. %C A252480 Also, numbers whose decimal representation cannot be split up between any two digits without producing a string with a leading zero (other than "0" itself). %C A252480 Also, numbers n > 9 such that floor(n/10) is in A011540, i.e., has a digit '0'. %H A252480 M. F. Hasler, <a href="/A252480/b252480.txt">Table of n, a(n) for n = 1..10000</a> %H A252480 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>. %t A252480 Select[Range[10,700],DigitCount[Floor[#/10],10,0]>0&] (* _Harvey P. Dale_, May 10 2020 *) %o A252480 (PARI) is(n)=n>9 && !vecmin(digits(n\10)) %K A252480 nonn,easy,base %O A252480 1,1 %A A252480 _M. F. Hasler_, Dec 28 2014