cp's OEIS Frontend

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.

A020895 Cubefree sums of two nonzero cubes.

This page as a plain text file.
%I A020895 #19 Apr 14 2019 14:09:09
%S A020895 2,7,9,19,26,28,35,37,61,63,65,91,98,117,124,126,127,133,169,215,217,
%T A020895 218,271,279,316,331,335,341,342,370,386,387,397,407,468,469,485,511,
%U A020895 539,547,559,602,604,631,637,657,665,721,730,737,793,817
%N A020895 Cubefree sums of two nonzero cubes.
%H A020895 Jean-François Alcover, <a href="/A020895/b020895.txt">Table of n, a(n) for n = 1..501</a>
%H A020895 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 A020895 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 A020895 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 A020895 nonn
%O A020895 1,1
%A A020895 _Steven Finch_
%E A020895 Set offset to 1, _Joerg Arndt_, Sep 07 2015