id:A049237 - OEIS Search Results

Search: id:A049237

Displaying 1-1 of 1 results found.

page 1

n/EulerPhi[n] for n in A007694.

+0
6

1, 2, 2, 3, 2, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2 (list; graph; listen)

	OFFSET	`1,2`
	REFERENCES	`Sarkozy A. and Suranyi J., Number Theory Problem Book (in Hungarian), Tankonyvkiado, Budapest, 1972.`
	FORMULA	`n/EulerPhi(n) is integer iff n=1 or n=2^w*3^u for w=1, 2, ... and u=0, 1, 2, ...`
	EXAMPLE	`For powers of 2 the quotient is 2. a[ 95 ]=124416/Phi[ 124416 ]=124416/41472=3.`
	CROSSREFS	`Cf. A007694.` `Sequence in context: A060131 A024677 A029374 this_sequence A073855 A077982 A099427` `Adjacent sequences: A049234 A049235 A049236 this_sequence A049238 A049239 A049240`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu)`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research