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 A085824 #15 Apr 05 2020 21:17:44
%S A085824 1,2,3,4,5,6,7,8,9,10,11,12,14,15,16,17,18,19,20,21,23,24,25,26,27,28,
%T A085824 30,34,35,36,37,38,39,41,44,45,48,51,52,54,55,56,57,59,61,64,66,68,77,
%U A085824 80,83,85,97,99,100,102,103,104,106,109,111,112,114,119,120,122,127,128
%N A085824 Numbers n such that the smallest prime containing exactly n 0's (A037053) requires only two nonzero digits.
%C A085824 In the first one thousand primes containing exactly n zeros, 140 use just two digits. 1008 is in the sequence.
%C A085824 Although this sequence probably thins out like the primes, it is infinite.
%C A085824 For indices n listed here (and no others), A037053(n) = a*10^(n+1)+b with a in {1,...,9} and b in {1, 3, 7, 9}. The sequence of numbers *not* in this sequence is 13, 22, 29, 31, 32, 33, 40, 42, 43, ... - _M. F. Hasler_, Feb 19 2016
%H A085824 Hans Havermann, <a href="/A085824/b085824.txt">Table of n, a(n) for n = 1..310</a>
%o A085824 (PARI) is_A085824(n)=forstep(m=n=10^(n+1),9*n,n,nextprime(m)<m+10 && return(1)) \\ _M. F. Hasler_, Feb 19 2016
%Y A085824 Cf. A037053.
%K A085824 nonn,base
%O A085824 1,2
%A A085824 _Robert G. Wilson v_, Jul 04 2003
%E A085824 Sequence rechecked (per request) and edited by _Charles R Greathouse IV_, Aug 03 2010