OFFSET
1,1
COMMENTS
a(n) is the least prime of the form Product_{k=i..i+2*n-1} prime(k) + Sum_{k=i..i+2*n-1} prime(k).
LINKS
Robert Israel, Table of n, a(n) for n = 1..119
EXAMPLE
For n = 4, a(4) = 191 * 193 * 197 * 199 * 211 * 223 * 227 * 229 + 191 + 193 + 197 + 199 + 211 + 223 + 227 + 229 = 3534749459194564381 is prime, where 191, ..., 229 are 8 consecutive primes, and no previous sequence of 8 consecutive primes works.
MAPLE
f:= proc(n) local L, v, i;
L:= [seq(ithprime(i), i=1..2*n)];
do
v:= convert(L, `*`) + convert(L, `+`);
if isprime(v) then return v fi;
L:= [op(L[2..2*n]), nextprime(L[2*n])];
od
end proc:
R:= seq(f(n), n=1..20);
CROSSREFS
KEYWORD
nonn
AUTHOR
Will Gosnell and Robert Israel, Nov 27 2025
STATUS
approved
