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.

A063470 Numbers n such that tau(n)*4 = phi(n).

Original entry on oeis.org

34, 45, 52, 102, 140, 156, 252, 360, 420
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
For n > 2, tau(n) > 2 and phi(n) <= n-1 so the least solution a(1) to tau(n)*k = phi(n), must be a(1) >= 2*k+1, for the case k=4, a(1) >= 2*4+1 = 9. - Enrique Pérez Herrero, May 12 2012

Crossrefs

Programs

  • PARI
    for(n=1,10^6, if(numdiv(n)*4==eulerphi(n),print(n)))

Formula

a(1) = A175667(4)
a(A112954(4)) = A112955(4). - Enrique Pérez Herrero, May 12 2012

Extensions

"full" keyword from Max Alekseyev, Mar 01 2010