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.

A039771 Numbers k such that phi(k) is a perfect cube.

Original entry on oeis.org

1, 2, 15, 16, 20, 24, 30, 85, 128, 136, 160, 170, 192, 204, 240, 247, 259, 327, 333, 351, 399, 405, 436, 494, 518, 532, 648, 654, 666, 684, 702, 756, 771, 798, 810, 1024, 1028, 1088, 1111, 1255, 1280, 1360, 1375, 1536, 1542, 1632, 1843, 1853, 1875, 1920, 2008
Offset: 1

Views

Author

Keywords

Comments

a(n) is prime only for a(2)=2, for other cases: eulerphi(p) = p-1 = n^3, and p = 1 + n^3 = (n+1)(n^2-n+1), so p cannot be a prime. - Enrique Pérez Herrero, Aug 29 2010
A013730 is a subsequence. - Enrique Pérez Herrero, Aug 29 2010

Examples

			phi(247) = 216 = 6*6*6.
		

Crossrefs

Programs

  • Maple
    q:= n-> (c-> iroot(c, 3)^3=c)(numtheory[phi](n)):
    select(q, [$1..2200])[];  # Alois P. Heinz, Sep 01 2025
  • Mathematica
    Select[ Range[ 2000 ], IntegerQ[ Power[ EulerPhi[ # ], 1/3 ] ]& ]
  • PARI
    for(n=1,1e4,if(ispower(eulerphi(n),3),print1(n", "))) \\ Charles R Greathouse IV, Jul 31 2011