The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060433 a(n) is the smallest odd number that can be represented as the sum of one or more consecutive primes in n ways. 0
 3, 5, 41, 1151, 311, 34421, 442019, 3634531, 48205429 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS C. Rivera, Prime Puzzles EXAMPLE a(2) = 5 because of 5 and 2+3 = 5. a(3) = 41 because of 41, 2+3+5+7+11+13 = 41 and 11+13+17 = 41. MATHEMATICA lim = 500000; cnt = Table[If[OddQ[n] && PrimeQ[n], 1, 0], {n, lim}]; ps = Prime[Range[PrimePi[lim]]]; sm = ps; i = 0; While[i++; j = 1; While[sm[[j]] = sm[[j]] + ps[[i + j]]; sm[[j]] <= lim, If[OddQ[sm[[j]]], cnt[[sm[[j]]]]++]; j++]; j > 1]; Table[Position[cnt, i, 1, 1][[1, 1]], {i, Union[cnt][[-1]]}] (* T. D. Noe, Nov 03 2011 *) CROSSREFS Sequence in context: A120265 A158328 A258933 * A216085 A219018 A191088 Adjacent sequences:  A060430 A060431 A060432 * A060434 A060435 A060436 KEYWORD nonn AUTHOR Jason Earls, Apr 06 2001 EXTENSIONS Edited by Larry Reeves (larryr(AT)acm.org), Apr 25 2001 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 14 01:44 EDT 2020. Contains 336474 sequences. (Running on oeis4.)