A383319 a(n) = prime(A383318(n)).
64553, 5, 11, 2, 37, 157, 47, 17, 7, 353, 389, 149, 137, 19, 23, 43, 467, 2539, 479, 139, 2339, 359, 241, 491, 401, 41, 7219, 167, 2417, 3, 179, 227, 809, 811, 5449, 7159, 5479, 59, 127, 6073, 103, 409, 521, 31, 251, 3547, 937, 3943, 499, 7121, 5791, 367, 29
Offset: 1
Links
- Dominic McCarty, Table of n, a(n) for n = 1..10000
Programs
-
Python
from sympy import prime from itertools import count a, b, sa, sb = [6455], [64553], "6455", "64553" for _ in range(30): a.append(next(n for k in count(1) if not (n := int(sb[len(sa):len(sa)+k])) in a and not (len(sb) > len(sa) + k and sb[len(sa) + k] == "0"))) b.append(prime(a[-1])) sa += str(a[-1]); sb += str(b[-1]) print(b)