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!)
A364692 Largest number that is the sum of n distinct primes in exactly n ways; 0 if no solution exists. 1

%I #15 Aug 06 2023 02:37:30

%S 68,130,42,59,76,0,0,161,192,233,227,276,0,425,480,0,0,0,752

%N Largest number that is the sum of n distinct primes in exactly n ways; 0 if no solution exists.

%H Carlos Rivera, <a href="https://www.primepuzzles.net/puzzles/puzz_1130.htm">Puzzle 1130. As 68</a>, The Prime Puzzles & Problems Connection.

%e 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.

%e 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.

%Y Cf. A344989 asks for the smallest number with the same properties.

%K nonn,more

%O 2,1

%A _Dmitry Kamenetsky_, Aug 03 2023

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 August 29 09:35 EDT 2024. Contains 375511 sequences. (Running on oeis4.)