A349764 - OEIS

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A349764

a(n) is the smallest number which can be represented as the sum of n distinct n-th powers of primes in exactly n ways.

5

2, 410, 8627527, 199898912404

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Table of n, a(n) for n=1..4.

EXAMPLE

For n = 2: 410 = 7^2 + 19^2 = 11^2 + 17^2.

For n = 3: 8627527 = 19^3 + 151^3 + 173^3 = 23^3 + 139^3 + 181^3 = 71^3 + 73^3 + 199^3.

From Michael S. Branicky, Dec 21 2021: (Start)

For n = 4: 199898912404 = 23^4 + 281^4 + 397^4 + 641^4,

= 137^4 + 383^4 + 467^4 + 601^4,

= 151^4 + 227^4 + 557^4 + 563^4,

= 257^4 + 317^4 + 347^4 + 643^4. (End)

CROSSREFS

Sequence in context: A070269 A352837 A352848 * A153911 A259562 A177321

Adjacent sequences: A349761 A349762 A349763 * A349765 A349766 A349767

KEYWORD

nonn,hard,bref,more

AUTHOR

Ilya Gutkovskiy, Dec 20 2021

EXTENSIONS

a(4) from Michael S. Branicky, Dec 21 2021

STATUS

approved