login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132810 Smallest sum of n consecutive odd primes which is a multiple of n. 5
3, 8, 15, 36, 395, 72, 119, 240, 2349, 300, 539, 276, 923, 714, 435, 496, 629, 702, 2375, 1120, 1995, 1144, 3979, 3192, 3925, 2938, 9531, 1960, 10063, 2670, 3441, 4448, 5907, 6358, 9835, 4464, 5069, 3610, 13533, 4000, 6273, 4410, 21113, 12012, 8325, 8142 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Zak Seidov, Table of n, a(n) for n = 1..1000

FORMULA

Let A132809(n)=prime(i). Then a(n)= sum(j=i...i+n-1) prime(j). - R. J. Mathar, Nov 27 2007

EXAMPLE

a(5)=395, associated with A132809(5)=71=prime(20) as the first of the 5 consecutive primes, is the smallest sum of 5 consecutive odd primes which is divisible by n=5.

CROSSREFS

Cf. A132809, A132811.

Sequence in context: A032255 A137475 A176433 * A032159 A174982 A032064

Adjacent sequences:  A132807 A132808 A132809 * A132811 A132812 A132813

KEYWORD

easy,nonn

AUTHOR

Enoch Haga, Sep 01 2007

EXTENSIONS

The example does not match the sequence. Also the offset for all of this bunch of sequences should probably be 1. - N. J. A. Sloane, Sep 13 2007

Edited by R. J. Mathar, Nov 27 2007

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 3 20:40 EST 2016. Contains 278745 sequences.