login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020896 Positive numbers n such that n = x^5 + y^5 has a solution in nonzero integers x, y. 2

%I

%S 2,31,33,64,211,242,244,275,486,781,992,1023,1025,1056,1267,2048,2101,

%T 2882,3093,3124,3126,3157,3368,4149,4651,6250,6752,7533,7744,7775,

%U 7777,7808,8019,8800,9031,10901,13682,15552,15783,15961,16564

%N Positive numbers n such that n = x^5 + y^5 has a solution in nonzero integers x, y.

%C 68101 = (15/2)^5 + (17/2)^5 is believed to be the smallest positive integer n which is the sum of two nonzero fifth powers of rational numbers but not the sum of two nonzero fifth powers of integers.

%H Vincenzo Librandi, <a href="/A020896/b020896.txt">Table of n, a(n) for n = 0..5000</a>

%H J.-P. Allouche and J. Shallit, Automatic Sequences, Cambridge Univ. Press, 2003, p. 99.

%H Steven R. Finch, <a href="http://www.people.fas.harvard.edu/~sfinch/csolve/fermat.pdf">On a Generalized Fermat-Wiles Equation</a> [broken link]

%H Steven R. Finch, <a href="http://web.archive.org/web/20010602030546/http://www.mathsoft.com/asolve/fermat/fermat.html">On a Generalized Fermat-Wiles Equation</a> [From the Wayback Machine]

%F See Theorem 3.5.6 of J.-P. Allouche and J. Shallit, Automatic Sequences, Cambridge Univ. Press, 2003, p. 99.

%e E.g. 31 = 2^5 + (-1)^5.

%t Select[Union[Total/@(Select[Tuples[Range[-8,8],{2}], !MemberQ[#, 0]&]^5)],#>0&] (* _Harvey P. Dale_, Apr 03 2011 *)

%Y Cf. A001481, A020897, A003336.

%K nonn,nice

%O 0,1

%A _Steven Finch_

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 14 08:08 EDT 2020. Contains 336480 sequences. (Running on oeis4.)