|
Search: id:A156775
|
|
|
| A156775 |
|
Number of iterations of x->(sigma(x)+phi(x))/2 until a non-integer or a previous term is reached, starting with x=n; a(n)=0 if this never happens. |
|
+0
2
|
|
| 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 3, 2, 1, 1, 1, 1, 2, 3, 2, 1, 4, 1, 3, 2, 4, 1, 3, 1, 1, 4, 3, 2, 1, 1, 4, 3, 2, 1, 9, 1, 3, 4, 2, 1, 7, 1, 1, 3, 2, 1, 8, 3, 2, 3, 2, 1, 4, 1, 8, 7, 1, 4, 3, 1, 2, 7, 6, 1, 1, 1, 4, 3, 4, 6, 5, 1, 2, 1, 2, 1, 5, 6, 5, 4, 3, 1, 9, 4, 3, 7, 6, 5, 4, 1, 1, 9, 1, 1, 5, 1, 9, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
In [Guy 1997] the iteration is said to fracture when sigma(x)+phi(x) becomes odd. It is not known if a(n)=0 for some n.
A156776(n) gives the number of iterations until the sequence fractures, resp. 0 if this never happens.
|
|
REFERENCES
|
Richard K. Guy, "Divisors and Desires", Amer. Math. Monthly, Vol. 104, No. 4 (Apr. 1997), 359.
|
|
EXAMPLE
|
Let f(x)=(sigma(x)+phi(x))/2. For x=1 we have f(x) = (1+1)/2 = 1, i.e. after a(1)=1 iterations, the initial term 1 is encountered. For x=2 we have f(x) = (3+1)/2 = 2, so a(2)=1 for the same reason; idem for x=3 and x=5. For x=4 we have f(x) = (7+2)/2 = 9/2, the sequence "fractures" after a(4)=1 iterations. For x=6 we have f(x) = (12+2)/2 = 7, f(7) = (8+6)/2 = 7: after a(6)=2 iterations, there's a value already seen before.
|
|
PROGRAM
|
(PARI) A156775(n, u=[])={ until( denominator( n=(sigma(n)+eulerphi(n))/2)>1 | setsearch(u, n), u=setunion(u, Set(n))); #u }
|
|
CROSSREFS
|
Cf. A065387(n) = A000203(n) + A000010(n).
Sequence in context: A082068 A082069 A136755 this_sequence A064693 A072085 A054868
Adjacent sequences: A156772 A156773 A156774 this_sequence A156776 A156777 A156778
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
M. F. Hasler (MHasler(AT)univ-ag.fr), Feb 15 2009
|
|
|
Search completed in 0.002 seconds
|
