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 A049462 #14 Oct 24 2020 17:23:12
%S A049462 2,11,151,1013,10867,100673,1000357,10000931,100000213,1000000901,
%T A049462 10000001797,100000000283,1000000001911,10000000012553,
%U A049462 100000000006087,1000000000011317,10000000000003471,100000000000017431
%N A049462 a(n) is the smallest n-digit prime p such that the concatenation a(1)a(2)...a(n-1)p is prime, with a(1) = 2.
%C A049462 The corresponding primes are certified for 44 < n < 60 (for the first 15 titanic primes). - _Metin Sariyar_, Oct 23 2020
%H A049462 Metin Sariyar, <a href="/A049462/b049462.txt">Table of n, a(n) for n = 1..100</a>
%e A049462 Starting with an initial prime of 2, next the smallest 2-digit prime which gives a prime is 11 (211, a prime), then 151 (3-digit prime) is the smallest to make 211151 a prime, etc.
%t A049462 NextPrim[n_] := Block[{k = n + 1}, While[ ! PrimeQ[k], k++ ]; k]; a[1] = 2; a[n_] := a[n] = Block[{p = Sum[ a[i]*10^(n(n + 1)/2 - i(i + 1)/2), {i, 1, n - 1}], q = NextPrim[10^(n - 1)]}, While[ !PrimeQ[p + q], q = NextPrim[q]]; q]; Table[ a[n], {n, 1, 19}] (* _Robert G. Wilson v_, Oct 18 2003 *)
%Y A049462 Cf. A080155, A083758.
%K A049462 nonn,base
%O A049462 1,1
%A A049462 _Jeff Heleen_, Oct 13 2003
%E A049462 More terms from _Robert G. Wilson v_, Oct 18 2003