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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A364692 Largest number that is the sum of n distinct primes in exactly n ways; 0 if no solution exists. 1
 68, 130, 42, 59, 76, 0, 0, 161, 192, 233, 227, 276, 0, 425, 480, 0, 0, 0, 752 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS Table of n, a(n) for n=2..20. Carlos Rivera, Puzzle 1130. As 68, The Prime Puzzles & Problems Connection. EXAMPLE 68 = 7 + 61 = 31 + 37 and there is no larger number that is the sum of 2 distinct primes in exactly 2 ways, so a(2)=68. 130 = 2 + 19 + 109 = 2 + 31 + 97 = 2 + 61 + 67 and there is no larger number that is the sum of 3 distinct primes in exactly 3 ways, so a(3)=130. CROSSREFS Cf. A344989 asks for the smallest number with the same properties. Sequence in context: A048889 A111379 A352298 * A044191 A044572 A153677 Adjacent sequences: A364689 A364690 A364691 * A364693 A364694 A364695 KEYWORD nonn,more AUTHOR Dmitry Kamenetsky, Aug 03 2023 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.

Last modified December 1 23:26 EST 2023. Contains 367503 sequences. (Running on oeis4.)