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 A139053 #18 May 07 2021 08:45:17 %S A139053 2,3,5,11,13,17,101,103,107,1009,1013,1019,10007,10009,10037,100003, %T A139053 100019,100043,1000003,1000033,1000037,10000019,10000079,10000103, %U A139053 100000007,100000037,100000039,1000000007,1000000009,1000000021,10000000019,10000000033,10000000061 %N A139053 Array read by rows: row n lists the first 3 primes with n digits. %H A139053 Michael S. Branicky, <a href="/A139053/b139053.txt">Table of n, a(n) for n = 1..3000</a> %t A139053 np[n_]:=Module[{a=NextPrime[10^n]},{a,NextPrime[a], NextPrime[NextPrime[ a]]}]; Flatten[Array[np,12,0]] (* _Harvey P. Dale_, Dec 14 2011 *) %t A139053 Flatten@Array[NextPrime[10^#,{1,2,3}]&,12,0] (* _Giorgos Kalogeropoulos_, May 06 2019 *) %o A139053 (Python) %o A139053 from sympy import nextprime %o A139053 def auptodigs(maxdigits): %o A139053 alst = [] %o A139053 for n in range(1, maxdigits+1): %o A139053 p1 = nextprime(10**(n-1)) %o A139053 p2 = nextprime(p1) %o A139053 p3 = nextprime(p2) %o A139053 alst.extend([p1, p2, p3]) %o A139053 return alst %o A139053 print(auptodigs(11)) # _Michael S. Branicky_, May 07 2021 %Y A139053 Cf. A000040, A003617, A073914, A139052, A139054. %K A139053 base,nonn,tabf %O A139053 1,1 %A A139053 _Omar E. Pol_, Apr 08 2008 %E A139053 More terms from _Max Alekseyev_, Dec 12 2011 %E A139053 a(32) and beyond from _Michael S. Branicky_, May 07 2021