login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049237 n/EulerPhi[n] for n in A007694. 5
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; refs; listen; history; internal format)
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: A174296 A163178 A029374 * A162361 A171135 A073855

Adjacent sequences:  A049234 A049235 A049236 * A049238 A049239 A049240

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:17 EST 2012. Contains 206035 sequences.