

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



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.


KEYWORD

nonn,more


AUTHOR



STATUS

approved



