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

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

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