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 A236529 #10 May 22 2025 10:21:36 %S A236529 5,53,5323,53231,532313,5323139,532313921,5323139219,532313921921, %T A236529 53231392192123,5323139219212343,53231392192123433, %U A236529 5323139219212343323,53231392192123433237,5323139219212343323721,532313921921234332372189,53231392192123433237218937,5323139219212343323721893721 %N A236529 Primes arising in A069607. %C A236529 a(n+1) is the next smallest prime beginning with a(n). Initial term is 5. %e A236529 a(1) = 5. %e A236529 a(2) is the next smallest prime that begins with 5, so a(2) = 53. %e A236529 a(3) is the next smallest prime that begins with 53, so a(3) = 5323. %e A236529 ...and so on. %o A236529 (Python) %o A236529 import sympy %o A236529 from sympy import isprime %o A236529 def b(x): %o A236529 num = str(x) %o A236529 n = 1 %o A236529 while n < 10**3: %o A236529 new_num = str(x) + str(n) %o A236529 if isprime(int(new_num)): %o A236529 print(int(new_num)) %o A236529 x = new_num %o A236529 n = 1 %o A236529 else: %o A236529 n += 1 %o A236529 b(5) %Y A236529 Cf. A069607, A110773, A048553. %K A236529 nonn,base %O A236529 1,1 %A A236529 _Derek Orr_, Jan 27 2014