OFFSET
1,1
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..411
MATHEMATICA
a[1] = 5; a[n_] := a[n] = Block[{k = a[n - 1] + 1 + Mod[a[n - 1], 2], c = IntegerDigits @ Table[ a[i], {i, n - 1}]}, While[ !PrimeQ[ FromDigits @ Flatten @ Append[c, IntegerDigits[k]]], k += 2]; k]; Table[ a[n], {n, 48}] (* Robert G. Wilson v *)
PROG
(Python)
from sympy import isprime
def aupton(terms):
alst, astr = [5], "5"
while len(alst) < terms:
an = alst[-1] + 2
while an%5 ==0 or not isprime(int(astr + str(an))): an += 2
alst, astr = alst + [an], astr + str(an)
return alst
print(aupton(48)) # Michael S. Branicky, May 09 2021
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Zak Seidov, Sep 23 2002
EXTENSIONS
More terms from Robert G. Wilson v, Aug 05 2005
STATUS
approved