login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A348791 a(n) is the smallest prime that can be written as the sum of a prime number of consecutive primes in exactly n ways, or -1 if no such number exists. 2
1, 5, 83, 863, 311, 1837067, 254298349, 2372135461 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
EXAMPLE
a(2) = 83 from 83 = 11+13+17+19+23 (5 primes) = 23+29+31 (3 primes).
a(4) = 311 from
311 = 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 (11 primes)
= 31 + 37 + 41 + 43 + 47 + 53 + 59 (7 primes)
= 53 + 59 + 61 + 67 + 71 (5 primes)
= 101 + 103 + 107 (3 primes).
CROSSREFS
Cf. A082283.
See A348790 for a different version.
Sequence in context: A348790 A173876 A368080 * A250549 A035512 A054953
KEYWORD
nonn,more,hard
AUTHOR
EXTENSIONS
a(6) from Michael S. Branicky, Nov 30 2021
a(7) from Michael S. Branicky, Dec 01 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 1 13:18 EDT 2024. Contains 372172 sequences. (Running on oeis4.)