OFFSET
1,1
COMMENTS
Primes of the form Product_{k=i..j} prime(k) - Sum_{k=i..j} prime(k).
j - i is always odd.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
a(7) = 1129 is a term because 3, 5, 7, 11 are consecutive primes and 1129 = 3*5*7*11 - (3+5+7+11) is prime.
MAPLE
N:= 2000; P:= select(isprime, [2, seq(i, i=3..N, 2)]): nP:= nops(P):
M:= P[-2]^2-1:
R:= {}:
for i from 1 to nP do
p:= P[i]; s:= P[i];
for j from i+1 to nP do
p:= p * P[j]; s:= s + P[j];
v:= p-s;
if v > M then break fi;
if isprime(v) then R:= R union {v}; Q[v]:= [i, j] fi;
od
od:
sort(convert(R, list));
PROG
(Python)
import heapq
from itertools import islice
from sympy import isprime, sieve
def agen(): # generator of terms
pp, ss, nextcount, alst, oldv = 6, 5, 3, [], -1
h = [(pp-ss, pp, ss, 1, 2)]
while True:
(v, pr, sm, s, l) = heapq.heappop(h)
if v > oldv and isprime(v):
yield v
oldv = v
if v >= pp-ss:
pp *= sieve[nextcount]
ss += sieve[nextcount]
heapq.heappush(h, (pp-ss, pp, ss, 1, nextcount))
nextcount += 1
pr //= sieve[s]; sm -= sieve[s]; s += 1; l += 1; pr *= sieve[l]; sm += sieve[l]
heapq.heappush(h, (pr-sm, pr, sm, s, l))
return alst
print(list(islice(agen(), 42))) # Michael S. Branicky, Nov 30 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Will Gosnell and Robert Israel, Nov 24 2025
STATUS
approved
