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.

A181123 Numbers that are the differences of two positive cubes.

Original entry on oeis.org

0, 7, 19, 26, 37, 56, 61, 63, 91, 98, 117, 124, 127, 152, 169, 189, 208, 215, 217, 218, 271, 279, 296, 316, 331, 335, 342, 386, 387, 397, 448, 469, 485, 488, 504, 511, 513, 547, 602, 604, 631, 657, 665, 702, 721, 728, 784, 817, 819, 866, 875, 919, 936, 973
Offset: 1

Views

Author

T. D. Noe, Oct 06 2010

Keywords

Comments

Because x^3-y^3 = (x-y)(x^2+xy+y^2), the difference of two cubes is a prime number only if x=y+1, in which case all the primes are cuban, see A002407.
The difference can be a square (see A038597), but Fermat's Last Theorem prevents the difference from ever being a cube. Beal's Conjecture implies that there are no higher odd powers in this sequence.
If n is in the sequence, it must be x^3-y^3 where 0 < y <= x < n^(1/2). - Robert Israel, Dec 24 2017

Crossrefs

Cf. A024352 (squares), A147857 (4th powers), A181124-A181128 (5th to 9th powers).

Programs

  • Maple
    N:= 10^4: # to get all terms <= N
    sort(convert(select(`<=`, {0, seq(seq(x^3-y^3, y=1..x-1),x=1..floor(sqrt(N)))}, N),list)); # Robert Israel, Dec 24 2017
  • Mathematica
    nn=10^5; p=3; Union[Reap[Do[n=i^p-j^p; If[n<=nn, Sow[n]], {i,Ceiling[(nn/p)^(1/(p-1))]}, {j,i}]][[2,1]]]
    With[{nn=60},Take[Union[Abs[Flatten[Differences/@Tuples[ Range[ nn]^3,2]]]], nn]] (* Harvey P. Dale, May 11 2014 *)
  • PARI
    list(lim)=my(v=List([0]),a3); for(a=2,sqrtint(lim\3), a3=a^3; for(b=if(a3>lim,sqrtnint(a3-lim-1,3)+1,1), a-1, listput(v,a3-b^3))); Set(v) \\ Charles R Greathouse IV, Jan 25 2018