OFFSET
1,1
COMMENTS
While calculating every possible C for such a sequence, the first "split" seems to be at C*193#, i.e. there appear to be two primes that simultaneously continue the sequence: floor[C*191# ]*193+30 and floor[C*191# ]*193+88. Terms above a(43) given here correspond to the smallest possible primes in the sequence. See also the arXiv paper linked below.
LINKS
Martin Raab, Table of n, a(n) for n = 1..100
Martin Raab, A prime number "Game of Life": can floor(y*p#) be prime for all p>=2?, arXiv:2403.17949 [math.GM], 2024.
FORMULA
Floor[C*p# ] where C=1.254196101578...
EXAMPLE
a(5)=2897 because the fifth prime is 11 and floor[11#*1.2541961...] = 2897 (2310*1.2541961... = 2897.19299...).
CROSSREFS
KEYWORD
nonn
AUTHOR
Martin Raab, Jan 21 2007, Feb 02 2007
STATUS
approved