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!)
A020895 Cubefree sums of two nonzero cubes. 4

%I #19 Apr 14 2019 14:09:09

%S 2,7,9,19,26,28,35,37,61,63,65,91,98,117,124,126,127,133,169,215,217,

%T 218,271,279,316,331,335,341,342,370,386,387,397,407,468,469,485,511,

%U 539,547,559,602,604,631,637,657,665,721,730,737,793,817

%N Cubefree sums of two nonzero cubes.

%H Jean-François Alcover, <a href="/A020895/b020895.txt">Table of n, a(n) for n = 1..501</a>

%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]

%t Reap[Do[If[Max[FactorInteger[n][[All, 2]] ] < 3, If[Reduce[a != 0 && b != 0 && n == a^3 + b^3, {a, b}, Integers] =!= False, Print[n]; Sow[n]]], {n, 2, 1000}]] [[2, 1]] (* _Jean-François Alcover_, Sep 07 2015 *)

%K nonn

%O 1,1

%A _Steven Finch_

%E Set offset to 1, _Joerg Arndt_, Sep 07 2015

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 May 6 23:04 EDT 2024. Contains 372298 sequences. (Running on oeis4.)