OFFSET
1,1
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
EXAMPLE
For n=1, start-prime = prime(1) = 2, 2+3=5 is prime, length=2, so a(1)=2;
for n=2, start-prime = prime(2) = 3, 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 = 127 is prime, length=9, all shorter partial sums are composite, so a(2)=9;
for n=160, prime(160) = 941, 941 + ... + 1609 = 121123 is prime, a(160)=95.
MATHEMATICA
Table[k = 2; While[CompositeQ@ Total@ Prime@ Range[n, n + k], k++]; k + 2 Boole[EvenQ@ k] - 1, {n, 120}] (* Michael De Vlieger, Jan 01 2017 *)
PROG
(PARI) a(n, p=prime(n))=my(q=p, t=2); while(!isprime(p+=q=nextprime(q+1)), t++); t
apply(p->a(0, p), primes(30)) \\ Charles R Greathouse IV, Jun 16 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, May 16 2002
EXTENSIONS
Escape clause added by N. J. A. Sloane, Nov 17 2020
STATUS
approved