|
| |
|
|
A066028
|
|
Largest prime which can be written as a sum of distinct primes <= prime(n).
|
|
1
| |
|
|
2, 5, 7, 17, 23, 41, 53, 67, 97, 127, 157, 197, 233, 281, 317, 379, 433, 499, 563, 631, 709, 773, 863, 953, 1051, 1153, 1259, 1361, 1471, 1583, 1709, 1831, 1979, 2113, 2273, 2417, 2579, 2731, 2909, 3079, 3259, 3433, 3631, 3823, 4021, 4219, 4423, 4651
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..1000
|
|
|
EXAMPLE
| n = 5: the following primes are sums of primes <= 11 = A000040(5): 2, 3, 5, 7, 11, 13, 17, 19 and 23 = 5+7+11 = 2+3+7+11, so a(5) = 23.
|
|
|
MATHEMATICA
| PrevPrim[n_] := Block[{k = n - 1}, While[ !PrimeQ[k], k-- ]; Return[k]]; Do[a = {1, 4, 6}; s = Sum[Prime[i], {i, 1, n}]; q = s; While[ !PrimeQ[q] || Length[ Position[a, s - q]] > 0, q = PrevPrim[q] ]; Print[q], {n, 1, 60} ]
|
|
|
CROSSREFS
| Cf. A007504
Sequence in context: A019084 A176676 A103805 * A066039 A142341 A045357
Adjacent sequences: A066025 A066026 A066027 * A066029 A066030 A066031
|
|
|
KEYWORD
| nice,nonn
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 11 2001
|
|
|
EXTENSIONS
| More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 12 2001
|
| |
|
|
