login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

%I #22 Dec 22 2021 14:21:32

%S 2,410,8627527,199898912404

%N 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.

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

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

%e From _Michael S. Branicky_, Dec 21 2021: (Start)

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

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

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

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

%Y Cf. A146756.

%K nonn,hard,bref,more

%O 1,1

%A _Ilya Gutkovskiy_, Dec 20 2021

%E a(4) from _Michael S. Branicky_, Dec 21 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 13 10:14 EDT 2024. Contains 375904 sequences. (Running on oeis4.)