|
| |
|
|
A097026
|
|
Function f[x]=EulerPhi[x]+Floor[x/2] is iterated; a(n) is the length of terminal cycle if the iteration was initiated at n. If finite cycle does not exist, then a[n]=0.
|
|
3
| |
|
|
1, 1, 1, 1, 2, 2, 2, 1, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 4, 1, 1, 1, 2, 1, 4, 4, 2, 1, 4, 4, 2, 4, 2, 2, 6, 4, 2, 4, 6, 4, 2, 2, 6, 4, 6, 2, 1, 2, 6, 2, 6, 2, 1, 1, 6, 2, 6, 6, 6, 1, 2, 6, 6, 6, 6, 6, 6, 2, 6, 6, 6, 6, 6, 6, 6, 2, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 6, 6, 6, 6, 6, 6, 6, 6, 6
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,5
|
|
|
COMMENTS
| While iteration of phi[x] leads always to fixed point, f[x]=phi[x]+incr[x] may result in cycles or is divergent.What is the magnitude of the added incrementing function?
|
|
|
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]=6;
n=2^j: a[2^j]=1, powers of 2 are fixed points.
Some initial values are hard to analyze. The first is n=163, so perhaps a[163]=0 by definition.
|
|
|
CROSSREFS
| Cf. A000010, A097027, A097028, A097029.
Sequence in context: A076447 A136690 A144703 * A189225 A169988 A067597
Adjacent sequences: A097023 A097024 A097025 * A097027 A097028 A097029
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Aug 27 2004
|
| |
|
|
