Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096866
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096866 Function A062402[x]=sigma[phi[x]] is iterated. Starting with n, a(n) is the smallest term arising in trajectory, either in transient or in terminal cycle. +0
5
1, 1, 3, 3, 5, 3, 7, 7, 7, 7, 7, 7, 13, 7, 15, 15, 17, 7, 19, 15, 21, 7, 23, 15, 25, 26, 27, 28, 29, 15, 31, 31, 28, 31, 31, 28, 37, 31, 31, 31, 31, 28, 43, 28, 31, 28, 31, 31, 49, 28, 51, 31, 53, 31, 31, 31, 57, 31, 31, 31, 61, 31, 63, 63, 65, 28, 67, 63, 31, 31, 71, 31, 73, 74 (list; graph; listen)
OFFSET

1,3

EXAMPLE

n=240: list={240,127,312,[252,195],252,..},a(240)=127, a transient;

n=254: list={254,312,[252,195],252,.}, a[254]=195, a recurrent term.

MATHEMATICA

gf[x_] :=DivisorSigma[1, EulerPhi[x]] gite[x_, hos_] :=NestList[gf, x, hos] Table[Min[gite[w, 20]], {w, 1, 256}]

CROSSREFS

Cf. A062401, A062402, A095955, A096859-A096865.

Sequence in context: A114003 A029622 A015126 this_sequence A015909 A029620 A048691

Adjacent sequences: A096863 A096864 A096865 this_sequence A096867 A096868 A096869

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research