OFFSET
1,1
COMMENTS
Group the primes such that the sum of each group is a prime. Each group from the second onwards should contain at least 3 primes: (2, 3), (5, 7, 11), (13, 17, 19, 23, 29), (31, 37, 41), (43, 47, 53, 59, 61), ... Sequence gives number of terms in each group.
LINKS
T. D. Noe, Table of n, a(n) for n = 1..10000
EXAMPLE
a(1)=2 because sum of first two primes 2+3 is prime.
a(2)=3 because sum of next three primes 5+7+11 is prime.
a(3)=5 because sum of next five primes 13+17+19+23+29 is prime.
MATHEMATICA
f[l_List] := Block[{n = Length[Flatten[l]], k = 3, r}, While[r = Table[Prime[i], {i, n + 1, n + k}]; ! PrimeQ[Plus @@r], k += 2]; Append[l, r]]; Length /@ Nest[f, {{2, 3}}, 100] (* Ray Chandler, May 11 2007 *)
cnt = 0; Table[s = Prime[cnt+1] + Prime[cnt+2]; len = 2; While[! PrimeQ[s], len++; s = s + Prime[cnt+len]]; cnt = cnt + len; len, {n, 100}] (* T. D. Noe, Feb 06 2012 *)
PROG
(Python)
from itertools import count, islice
from sympy import isprime, nextprime
def agen(): # generator of terms
s, i, p = 0, 1, 2
while True:
while not(isprime(s:=s+p)) or i < 2:
i, p = i+1, nextprime(p)
yield i
s, i, p = 0, 1, nextprime(p)
print(list(islice(agen(), 82))) # Michael S. Branicky, May 23 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Aug 11 2002
EXTENSIONS
More terms from Gabriel Cunningham (gcasey(AT)mit.edu), Apr 10 2003
Extended by Ray Chandler, May 02 2007
STATUS
approved
