|
Search: id:A070934
|
|
|
| A070934 |
|
Smallest prime equal to the sum of 2n+1 consecutive primes. |
|
+0
15
|
|
| 2, 23, 53, 197, 127, 233, 691, 379, 499, 857, 953, 1151, 1259, 1583, 2099, 2399, 2417, 2579, 2909, 3803, 3821, 4217, 4651, 5107, 5813, 6829, 6079, 6599, 14153, 10091, 8273, 10163, 9521, 12281, 13043, 11597, 12713, 13099, 16763, 15527, 16823, 22741
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
EXAMPLE
|
Every term of the increasing sequence of primes 127,401,439,479,593,... is splittable into a sum of 9 consecutive odd primes and 127=3+5+7+11+13+17+19+23+29 is the least one corresponding to n=4.
|
|
MATHEMATICA
|
f[n_] := Block[{k = 1, s}, While[s = Sum[Prime[i], {i, k, k + 2n}] ; ! PrimeQ[s], k++ ]; s]; Table[f[n], {n, 0, 41}] (*Chandler*)
|
|
CROSSREFS
|
Cf. Bisection of A070281.
See A082244 for another version.
Sequence in context: A074809 A084237 A106928 this_sequence A031915 A102385 A042679
Adjacent sequences: A070931 A070932 A070933 this_sequence A070935 A070936 A070937
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Lekraj Beedassy (blekraj(AT)yahoo.com), May 21 2002
|
|
EXTENSIONS
|
Corrected and extended by Ray G. Opao (1260(AT)email.com), Aug 26 2004
Entry revised by Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 27 2006
|
|
|
Search completed in 0.002 seconds
|
