Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049107
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049107 Euler phi function applied 5 times. +0
3
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 4, 1, 4, 1, 2, 2, 4, 1, 2, 2, 2, 2, 2, 2, 4, 1, 2, 2, 4, 2, 4, 2, 2 (list; graph; listen)
OFFSET

1,41

EXAMPLE

n=163, the successive iterates applying Euler totient function are as follows: 163,162,54,18,6,2,1. The 6th term is 2, when Phi was applied 5 times. So a(163)=2, already a power of 2.

MATHEMATICA

a(n)=Nest[ EulerPhi, n, 5 ]

CROSSREFS

A000010, A010554.

Sequence in context: A074971 A132587 A008651 this_sequence A046597 A107910 A085006

Adjacent sequences: A049104 A049105 A049106 this_sequence A049108 A049109 A049110

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research