cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

Dmitry Kamenetsky, Aug 03 2023

Keywords

Examples

			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.