This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A020898 #49 Mar 14 2023 09:32:44
%S A020898 2,6,7,9,12,13,15,17,19,20,22,26,28,30,31,33,34,35,37,42,43,49,50,51,
%T A020898 53,58,61,62,63,65,67,68,69,70,71,75,78,79,84,85,86,87,89,90,91,92,94,
%U A020898 97,98,103,105,106,107,110,114,115,117,123,124,126,127,130
%N A020898 Positive cubefree integers n such that the Diophantine equation X^3 + Y^3 = n*Z^3 has solutions.
%C A020898 These numbers are the cubefree sums of two nonzero rational cubes.
%C A020898 This sequence does not contain A202679, which has members that are not cubefree. - _Robert Israel_, Mar 16 2016
%C A020898 Notice that 34^3 + 74^3 = 48*21^3 = 6*42^3 because 48 = 6*2^3 is not cubefree, but now 17^3 + 37^3 = 6*21^3 and 6 is already listed in the sequence. - _Michael Somos_, Mar 13 2023
%D A020898 B. N. Delone and D. K. Faddeev, The Theory of Irrationalities of the Third Degree, Amer. Math. Soc., 1964.
%D A020898 L. E. Dickson, History of The Theory of Numbers, Vol. 2, Chap. XXI, Chelsea NY 1966.
%D A020898 L. J. Mordell, Diophantine Equations, Academic Press, Chap. 15.
%H A020898 David W. Wilson, <a href="/A020898/b020898.txt">Table of n, a(n) for n = 1..255</a> (from Finch paper)
%H A020898 J. H. E. Cohn, <a href="http://www.jstor.org/stable/2691526">The £ 450 question</a>, Math. Mag., 73 (no. 3, 2000), 220-226.
%H A020898 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 A020898 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]
%e A020898 37^3 + 17^3 = 6*21^3 is the smallest positive solution for n = 6 (found by Lagrange).
%e A020898 5^3 + 4^3 = 7*3^3 is the smallest positive solution for n = 7.
%t A020898 (* A naive program with a few pre-computed terms *) nmax = 130; xmax = 2000; CubeFreePart[n_] := Times @@ Power @@@ ({#[[1]], Mod[#[[2]], 3]} & /@ FactorInteger[n]); nn = Reap[ Do[ n = CubeFreePart[ x*y*(x+y) ]; If[ 1 < n <= nmax, Sow[n]], {x, 1, xmax}, {y, x, xmax}]][[2, 1]] // Union; A020898 = Union[nn, {17, 31, 53, 67, 71, 79, 89, 94, 97, 103, 107, 123}](* _Jean-François Alcover_, Mar 30 2012 *)
%Y A020898 Cf. A159843, A166246, A228499, A254324, A254326.
%K A020898 nonn,nice
%O A020898 1,1
%A A020898 _Steven Finch_
%E A020898 Entry revised by _N. J. A. Sloane_, Aug 12 2004
%E A020898 Links updated by _Max Alekseyev_, Oct 17 2007 and Dec 12 2007