[go: up one dir, main page]

login
A007610
Sum of n consecutive primes starting at a(n) is prime (or 0 if impossible).
(Formerly M0343)
3
2, 2, 5, 2, 5, 2, 17, 0, 3, 0, 5, 2, 29, 2, 3, 0, 3, 0, 11, 0, 7, 0, 7, 0, 5, 0, 7, 0, 13, 0, 13, 0, 7, 0, 5, 0, 5, 0, 13, 0, 7, 0, 7, 0, 7, 0, 7, 0, 11, 0, 17, 0, 3, 0, 3, 0, 97, 0, 29, 2, 3, 0, 13, 2, 3, 0, 19, 0, 19, 0, 3, 0, 5, 0, 3, 0, 23, 0, 7, 0, 11, 0, 53, 0, 31, 0, 89, 0, 53, 0, 19, 0, 11, 0, 3, 2
OFFSET
1,1
COMMENTS
a(n) = 0 iff n is even and the sum of 2..P(n) is not prime. See A013916. - Robert G. Wilson v, Feb 16 2002
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
C. W. Trigg, Prime sums of consecutive primes, J. Rec. Math., 18 (No. 4, 1985-1986), 247-248.
LINKS
C. W. Trigg, Prime sums of consecutive primes, J. Rec. Math., 18 (No. 4, 1985-1986), 247-248. (Annotated scanned copy)
MATHEMATICA
f[n_] := If[OddQ@ n, Block[{k = 1}, While[ !PrimeQ[Plus @@ Prime[Range[k, k + n - 1]]], k++]; Prime@ k], If[ PrimeQ[Plus @@ Prime@ Range@ n], 2, 0]]; Array[f, 96] (* Robert G. Wilson v, May 11 2015 *)
CROSSREFS
Sequence in context: A076200 A039931 A128645 * A068066 A171889 A171868
KEYWORD
nonn,nice,easy
STATUS
approved