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 A300102 #27 May 04 2018 08:16:06 %S A300102 2,101,1009,10007,100003,1000003,20000003,100000007,1000000007, %T A300102 30000000001,100000000003,2000000000003,40000000000001, %U A300102 1000000000000037,6000000000000001,20000000000000003,100000000000000003,1000000000000000003,60000000000000000007,500000000000000000003 %N A300102 Smallest prime containing exactly n consecutive 0's. %C A300102 Sequence agrees with A037053 up to a(31) (see comment in A037053). A269230 lists indices where these 2 sequences differ. %C A300102 For the first 1001 terms of this sequence, the number of nonzero digits of each term is 4 or less. This differs from A037053 for which the number of nonzero digits is 3 or less for the first 12000 terms. Does there exist n such that a(n) has 5 or more nonzero digits? %C A300102 a(n) has 3 nonzero digits for n = 13, 22, 29, 31, 32, 33, 40, 42, 43, ... %C A300102 a(n) has 4 nonzero digits for n = 192, 213, 238, 250, 252, 257, 268, 293, 297, 303, ... %C A300102 a(n) <> A037053(n) and a(n) = A037053(m) for some m > n for n = 436, 780, 845, 866, 894, 911, 945, 957, 967, ... In all these cases so far, a(n) has n+1 zero digits. Are there n satisfying these conditions such that a(n) has more than n+1 zero digits? %C A300102 Sequence is not monotonically increasing; indices for which a(n) > a(n+1) are 22, 43, 47, 58, 67, 105, 108, 121, 132, 144, 192, 220, 238, 250, 252, 257, 261, 270, ... %H A300102 Chai Wah Wu, <a href="/A300102/b300102.txt">Table of n, a(n) for n = 0..1000</a> %Y A300102 Cf. A037053, A269230, A269260. %K A300102 nonn,base %O A300102 0,1 %A A300102 _Chai Wah Wu_, Feb 25 2018