A350430 a(n) is the smallest n-th power which can be represented as the sum of n distinct positive n-th powers in exactly n ways, or -1 if none exists.

1, 625, 157464

Offset

1,2

Comments

From Jon E. Schoenfield, Dec 30 2021: (Start)

222000^4 < a(4) < 4891341^4 = lcm(2829, 12259, 16359, 30381)^4 (see A039664, including the Wroblewski link).

10000^5 <= a(5) < 12528^5 = lcm(72, 1044, 1392, 2088, 3132)^5 (see A063923, including the Waldby link; note that, although the terms of A063923 include 72, 144, 1044, 1392, and 2088, whose LCM is only 4176, the primitive solution in which the sum of 5 distinct 5th powers is 144^5 is 0^5 + 27^5 + 84^5 + 110^5 + 133^5 = 144^5, which is not the sum of 5 positive n-th powers).

Conjecture: a(6) = -1. (End)

Links

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

Example

For n = 2: 625 = 25^2 = 7^2 + 24^2 = 15^2 + 20^2.
For n = 3: 157464 = 54^3 = 6^3 + 36^3 + 48^3 = 12^3 + 19^3 + 53^3 = 27^3 + 36^3 + 45^3.

Crossrefs

Cf. A007666, A025303, A025401, A030052, A039664, A063923, A146756, A230718, A331675.

Sequence in context: A223230 A017584 A223260 * A187456 A223318 A222278

Adjacent sequences: A350427 A350428 A350429 * A350431 A350432 A350433

Keyword

nonn,bref,hard,more

Author

Ilya Gutkovskiy, Dec 30 2021

Status

approved