|
Search: id:A007610
|
|
|
| A007610 |
|
Sum of n consecutive primes starting at a(n) is prime (or 0 if impossible).
(Formerly M0343)
|
|
+0
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
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n) = 0 iff n is even and the sum of 2...P(n) is not prime. - Robert G. Wilson v (rgwv(AT)rgwv.com), 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), 247ff.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
|
|
MATHEMATICA
|
Do[k = n; a = Table[ Prime[i], {i, 1, n} ]; If[ OddQ[n], While[ !PrimeQ[ Apply[ Plus, a]], k++; a = Drop[a, 1]; a = Append[a, Prime[k]]], If[ PrimeQ[ Apply[ Plus, a]], a, a[[1]] = 0]]; Print[ a[[1]]], {n, 1, 100} ]
|
|
CROSSREFS
|
Cf. A013916, A071149
Sequence in context: A076200 A039931 A128645 this_sequence A068066 A101910 A162784
Adjacent sequences: A007607 A007608 A007609 this_sequence A007611 A007612 A007613
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com), Mira Bernstein (mira(AT)math.berkeley.edu)
|
|
|
Search completed in 0.002 seconds
|
