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 A064792 #19 Jan 17 2025 19:28:18
%S A064792 23,31,53,71,113,131,173,191,233,293,311,373,419,431,479,5303,593,613,
%T A064792 673,719,733,797,839,8923,971,1013,1031,10709,1091,11311,1277,1319,
%U A064792 1373,1399,1493,1511,1571,1637,16703,1733,17903,1811,1913,1931,1973
%N A064792 Append more digits to the n-th prime (leading zeros are permitted) until another prime is reached.
%C A064792 Differs from A030670 in that here the appended digits may start with 0 which is not possible there (although zeros are allowed there, too, if they are not the first appended digit): The first difference appears at a(16) = 5303 where A030670(16) = 5323. - _M. F. Hasler_, Jan 15 2025
%H A064792 Daniel Mondot, <a href="/A064792/b064792.txt">Table of n, a(n) for n = 1..10000</a>
%F A064792 a(n) = A030665(prime(n)). - _Michel Marcus_, Jan 17 2025
%o A064792 (PARI) apply( {A064792(n)=n=prime(n);for(L=1,oo, n*=10; forstep(s=1,10^L-1,2, isprime(n+s)&& return(n+s)))}, [1..44]) \\ _M. F. Hasler_, Jan 15 2025
%Y A064792 Cf. A030665.
%Y A064792 See A030670 for another version. Note that A030670 >= a(n). Cf. A065112.
%K A064792 nonn,base
%O A064792 1,1
%A A064792 _Reinhard Zumkeller_, Oct 17 2001