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.

A063469 Numbers n such that tau(n)*3 = phi(n).

Original entry on oeis.org

7, 21, 26, 56, 70, 78, 108, 126, 168, 210
Offset: 1

Views

Author

Jason Earls, Jul 26 2001

Keywords

Comments

"phi(n)=k*Tau[n] has at most finitely many solutions for any constant k or even for slowly increasing functions like k(n)=n^(epsilon)." - Labos Elemer, Jul 20 2001

Crossrefs

Programs

  • Mathematica
    Select[Range[300],3DivisorSigma[0,#]==EulerPhi[#]&] (* Harvey P. Dale, Sep 15 2016 *)
  • PARI
    for(n=1,10^7, if(3*numdiv(n)==eulerphi(n),print(n)))

Extensions

"full" keyword from Max Alekseyev, Mar 01 2010