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.

A066890 Cubes that are the sum of three distinct positive cubes.

This page as a plain text file.
%I A066890 #24 May 21 2022 14:04:58
%S A066890 216,729,1728,5832,6859,8000,13824,15625,19683,21952,24389,27000,
%T A066890 46656,54872,64000,68921,74088,85184,91125,97336,110592,125000,148877,
%U A066890 157464,175616,185193,195112,216000,250047,287496,300763,328509,343000,357911,373248,421875
%N A066890 Cubes that are the sum of three distinct positive cubes.
%D A066890 David Wells, The Penguin Dictionary of Curious and Interesting Numbers (Rev. ed. 1997), pp. 130, 147.
%H A066890 Donovan Johnson, <a href="/A066890/b066890.txt">Table of n, a(n) for n = 1..1000</a>
%F A066890 a(n) = (A023042(n))^3. - _Christian N. K. Anderson_, Aug 10 2014
%e A066890 729 is included because it is 9^3 and 1^3 + 6^3 + 8^3 = 729.
%t A066890 maxCube = (m = 67)^3; Reap[ Do[ bmax = (maxCube - a^3)^(1/3) // Ceiling; Do[ cmax = (maxCube - b^3)^(1/3) // Ceiling; Do[ n = a^3 + b^3 + c^3; If[n <= maxCube, If[ IntegerQ[n^(1/3)], Sow[n]]], {c, b, cmax}], {b, a, bmax}], {a, 1, (maxCube - 2)^(1/3) // Ceiling}]][[2, 1]] // Flatten // Union (* _Jean-François Alcover_, Mar 07 2013 *)
%K A066890 nonn
%O A066890 1,1
%A A066890 _Harvey P. Dale_, Jan 22 2002
%E A066890 Offset corrected by _Arkadiusz Wesolowski_, Aug 06 2012