id:A054740 - OEIS Search Results

Search: id:A054740

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`EulerPhi of x divides x (A007694) if and only if EulerPhi divides x-EulerPhi. This quotient is smaller by 1 than A049237.`
	REFERENCES	`Sarkozy A. and Suranyi J., Number Theory Problem Book (in Hungarian)`
	FORMULA	`A051953[A007694(n)]/A000010[A007694(n)] = A049237(n)-1`
	EXAMPLE	`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`
	CROSSREFS	`A000010, A049237, A007694, A051953.` `Sequence in context: A006340 A076371 A106149 this_sequence A118458 A118459 A083870` `Adjacent sequences: A054737 A054738 A054739 this_sequence A054741 A054742 A054743`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Apr 26 2000`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research