Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097028
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097028 Function f[x]=EulerPhi[x]+Floor[x/2] is iterated; a(n) is the length of transient part and terminal-cycle if the iteration was initiated at n. So a(n) is the number of distinct terms arising during iteration. +0
4
1, 1, 1, 1, 2, 2, 3, 1, 2, 2, 2, 3, 3, 4, 1, 1, 5, 2, 5, 3, 2, 2, 4, 4, 2, 3, 4, 4, 6, 4, 3, 1, 4, 5, 5, 4, 4, 5, 23, 5, 4, 5, 22, 6, 2, 2, 24, 6, 25, 3, 3, 4, 23, 3, 21, 5, 2, 3, 21, 3, 25, 26, 21, 1, 6, 24, 20, 25, 23, 22, 27, 4, 26, 27, 36, 28, 35, 22, 33, 5, 30, 31, 20, 25, 28, 29, 20, 26, 29 (list; graph; listen)
OFFSET

1,5

FORMULA

a(n)=A097026(n)+A097027(n)=c[n]+t[n].

EXAMPLE

n=70:iteration-list={70, 59, 87, 99, 109, 162, 135, 139, 207, 235, 301, 402, 333, 382, 381, 442, [413, 554, 553, 744, 612, 498], 413}, a[70]=22.

n=2^j: a[2^j]=1, powers of 2 are fixed points, free of transients, so t+c = 0+1 = 1.

CROSSREFS

Cf. A000010, A097026, A097028, A097029.

Sequence in context: A071435 A119428 A051521 this_sequence A092331 A089293 A034968

Adjacent sequences: A097025 A097026 A097027 this_sequence A097029 A097030 A097031

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Aug 27 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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research