|
Search: id:A070281
|
|
|
| A070281 |
|
Smallest prime which is the sum of n consecutive primes, or 0 if no such prime exists. |
|
+0
2
|
|
| 2, 5, 23, 17, 53, 41, 197, 0, 127, 0, 233, 197, 691, 281, 379, 0, 499, 0, 857, 0, 953, 0, 1151, 0, 1259, 0, 1583, 0, 2099, 0, 2399, 0, 2417, 0, 2579, 0, 2909, 0, 3803, 0, 3821, 0, 4217, 0, 4651, 0, 5107, 0, 5813, 0, 6829, 0, 6079, 0, 6599, 0, 14153, 0, 10091, 7699
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
MATHEMATICA
|
f[n_] := Block[{k = 1, s}, If[Mod[n, 2] == 0, s = Sum[Prime[i], {i, k, k + n - 1}]; If[PrimeQ[s], s, 0], While[s = Sum[Prime[i], {i, k, k + n - 1}] ; ! PrimeQ[s], k++ ]; s]]; Table[f[n], {n, 65}] (*Chandler*)
|
|
CROSSREFS
|
Cf. A070934.
Adjacent sequences: A070278 A070279 A070280 this_sequence A070282 A070283 A070284
Sequence in context: A050994 A034384 A078419 this_sequence A019368 A141171 A038919
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 07 2002
|
|
EXTENSIONS
|
Corrected and extended by Jim Nastos, Jun 15, 2002
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 27 2006
|
|
|
Search completed in 0.002 seconds
|
