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 A053546 #30 Jul 06 2019 14:24:49
%S A053546 11,127,1231,12343,123457,12345623,123456719,1234567801,1234567891,
%T A053546 1234567891003,12345678910111,12345678910111207,1234567891011121309,
%U A053546 123456789101112131449,12345678910111213141523,123456789101112131415161,123456789101112131415161717
%N A053546 Smallest prime containing a leading sequence of n ascending numbers.
%C A053546 The Magma Calculator (http://magma.maths.usyd.edu.au/calc/) verified each of the 100 terms in the table as prime. - _Jon E. Schoenfield_, Aug 24 2009
%C A053546 Can this sequence be proved to be infinite, a sort of Dirichlet's Theorem in reverse? - _Charles R Greathouse IV_, Jul 23 2011
%H A053546 T. D. Noe, <a href="/A053546/b053546.txt">Table of n, a(n) for n = 1..100</a> (probable primes)
%e A053546 a(6) = 12345623 is the smallest prime beginning with the string 123456.
%t A053546 sp[n_]:=Module[{m=1,np},np=NextPrime[n*10^m];While[Floor[np/10^m] != n,m++;np=NextPrime[n*10^m]];np]; sp/@Table[FromDigits[ Flatten[ IntegerDigits/@ Range[x]]],{x,20}] (* _Harvey P. Dale_, May 22 2016 *)
%K A053546 base,easy,nice,nonn
%O A053546 1,1
%A A053546 _Enoch Haga_, Jan 16 2000