OFFSET
1,1
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..439
MATHEMATICA
a[1] = 10; 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, 46}] (* Robert G. Wilson v, Aug 05 2005 *)
PROG
(Python)
from sympy import isprime
def aupton(terms):
alst, astr = [10], "10"
while len(alst) < terms:
k = alst[-1] + 1 + (alst[-1]%2)
while not isprime(int(astr+str(k))): k += 2
alst.append(k)
astr += str(k)
return alst
print(aupton(46)) # Michael S. Branicky, Oct 13 2021
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Zak Seidov, Sep 23 2002
EXTENSIONS
More terms from Robert G. Wilson v, Aug 05 2005
STATUS
approved