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!)
A132410 Positive integers whose sixth power is the sum of seven sixth powers (smallest primitive solutions). 1

%I #15 Aug 20 2023 10:49:46

%S 1141,1645,1757,2009,2023,2471,3073,3773,3983,4445,4543,4781,4837,

%T 4865,4879,4963,5075,5089,5159,5173,5327,5327,5411,5537,5537,5551,

%U 5761,5789,5887,6013,6041,6041,6083,6097,6293,6377,6419,6629,6713

%N Positive integers whose sixth power is the sum of seven sixth powers (smallest primitive solutions).

%C The terms given are the smallest integers that give primitive solutions. Repeated terms indicate multiple solutions.

%C Source: 1141, Lander, Parkin and Selfridge 1966; 1645 to 3073, Jean-Charles Meyrignac 1999; 3773 to 14945, Peter J Ansell, 2009

%H Peter J Ansell, <a href="/A132410/b132410.txt">Table of n, a(n) for n = 1..172</a>

%H Peter J Ansell, <a href="https://sites.google.com/site/sevensixthpowers/">Sums of seven sixth powers</a>

%H Greg Childers, <a href="http://euler.free.fr/resta.htm">RESTA's algorithm</a>, ca. 2000, incomplete table with higher terms.

%H <a href="/index/Di#Diophantine">Index to sequences related to Diophantine equations</a> (6,1,7)

%e 4879^6 = 2206^6 + 1263^6 + 4806^6 + 3126^6 + 2172^6 + 1446^6 + 18^6.

%K nonn

%O 1,1

%A Peter J. Ansell (COMP-MAN (at) live (dot) com), Apr 16 2009

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 March 19 01:57 EDT 2024. Contains 370952 sequences. (Running on oeis4.)