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.

A054740 Cototient(n)/totient(n) when this is an integer.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2
Offset: 1

Views

Author

Labos Elemer, Apr 26 2000

Keywords

Comments

EulerPhi of x divides x (A007694) if and only if EulerPhi divides x-EulerPhi. This quotient is smaller by 1 than A049237.

Examples

			x=2592, Phi[2592]=864, Cototient[x]=2592-864=1728 and the quotients are as follows: x/Phi=2592/864=3 or Cototient[x]/Phi[x]=1728/864=2; x always has a form of 2^u*3^w
		

References

  • Sárközy A. and Suranyi J., Number Theory Problem Book (in Hungarian)

Crossrefs

Programs

  • Mathematica
    Select[(#-EulerPhi[#])/EulerPhi[#]&/@Range[300000],IntegerQ] (* Harvey P. Dale, Mar 01 2015 *)

Formula