Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097004
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097004 Function A062402[x]=phi[sigma[x]] is iterated. Starting with 2^n, the n-th power of 2, a(n) is the count of distinct terms arising in trajectory; a(n)=t(n)+c(n)=t+c, where t is the number of transient terms, c is the number of recurrent terms [in the terminal cycle]. +0
2
1, 2, 2, 3, 2, 4, 5, 5, 2, 4, 5, 11, 4, 4, 12, 17, 2, 8, 11, 14, 26, 11, 6, 80, 59, 100, 101, 95, 93, 60, 38, 55, 2 (list; graph; listen)
OFFSET

0,2

EXAMPLE

n=13:2^n=8192,trajectory ={8192,8191,26208,[20440],.. }, a[13]=3+1=4 with 3 tranients and one recurrent term.

MATHEMATICA

EulerPhi[DivisorSigma[1, x]] itef[x_, len_] :=NestList[fs, x, len] Table[Length[Union[itef[2^w, 1000]]], {w, 1, 256}]

CROSSREFS

Cf. A000010, A000203, A062402, A096852, A096857.

Sequence in context: A144369 A033822 A144428 this_sequence A053023 A153725 A102247

Adjacent sequences: A097001 A097002 A097003 this_sequence A097005 A097006 A097007

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 21 2004

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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research