|
Search: id:A088677
|
|
|
| A088677 |
|
Numbers that can be represented as a^6+b^6, with 0<a<b, in exactly one way. |
|
+0
1
|
|
| 65, 730, 793, 4097, 4160, 4825, 15626, 15689, 16354, 19721, 46657, 46720, 47385, 50752, 62281, 117650, 117713, 118378, 121745, 133274, 164305, 262145, 262208, 262873, 266240, 277769, 308800, 379793, 531442, 531505, 532170, 535537, 547066
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Conjecture: no number can be expressed such a sum in more than one way.
Ekl (1996) has searched and found no solutions to the 6.2.2 Diophantine equation A^6 + B^6 = C^6 + D^6 with sums less than 7.25 * 10^26. - Jonathan Vos Post (jvospost2(AT)yahoo.com), May 04 2006
|
|
REFERENCES
|
Ekl, R. L. "New Results in Equal Sums of Like Powers." Math. Comput. 67, 1309-1315, 1998.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Diophantine Equation: 6th Powers.
|
|
EXAMPLE
|
65 = 1^6+2^6.
|
|
PROGRAM
|
(PARI) powers2(m1, m2, p1) = { for(k=m1, m2, a=powers(k, p1); if(a==1, print1(k", ")) ); } powers(n, p) = { z1=0; z2=0; c=0; cr = floor(n^(1/p)+1); for(x=1, cr, for(y=x+1, cr, z1=x^p+y^p; if(z1 == n, c++); ); ); return(c) }
|
|
CROSSREFS
|
Cf. A003358.
Sequence in context: A116678 A020292 A031421 this_sequence A034680 A017675 A013954
Adjacent sequences: A088674 A088675 A088676 this_sequence A088678 A088679 A088680
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Nov 22 2003
|
|
EXTENSIONS
|
Edited by Don Reble (djr(AT)nk.ca), May 03 2006
|
|
|
Search completed in 0.002 seconds
|
