|
| |
|
|
A100697
|
|
Smallest prime equal to the sum of exactly 2n+1 distinct odd primes in at least n ways.
|
|
0
| |
|
|
3, 19, 53, 97, 151, 223, 307, 409, 541, 673, 829, 1009, 1201, 1423, 1657, 1913, 2179, 2503, 2797, 3163, 3499, 3889, 4297, 4723, 5179, 5647, 6151, 6661, 7207, 7789, 8363, 8969, 9613, 10271, 10957, 11677, 12409, 13177, 13963, 14779, 15619, 16477, 17359
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
EXAMPLE
| a(1) = 19 = 3+5+11;
a(2) = 53 = 5+7+11+13+17 = 3+7+11+13+17;
a(3) = 97 = 3+5+7+11+13+17+41 = 3+5+7+11+17+23+31 = 3+5+7+11+19+23+29.
|
|
|
CROSSREFS
| Sequence in context: A023280 A054697 A112627 * A134268 A088798 A027272
Adjacent sequences: A100694 A100695 A100696 * A100698 A100699 A100700
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Dec 08 2004
|
|
|
EXTENSIONS
| Edited, corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Apr 30 2007
|
| |
|
|
