A352913 a(n) = largest prime of the form prime(n) + k! (k >= 0).
3, 5, 29, 727, 3628811, 733, 39916817, 87178291219, 20922789888023, 2432902008176640029, 1124000727777607680031, 8683317618811886495518194401280000037, 15511210043330985984000041, 523022617466601111760007224100074291200000043, 2658271574788448768043625811014615890319638528000000047
Offset: 1
Keywords
Links
- Michael S. Branicky, Table of n, a(n) for n = 1..93
Programs
-
Python
from sympy import isprime, prime from itertools import count, islice def agen(): # generator of terms for n in count(1): pn, fk = prime(n), 1 for k in range(1, pn+1): if isprime(pn + fk): yield pn + fk fk *= k print(list(islice(agen(), 51))) # Michael S. Branicky, Apr 16 2022