A096993 Function A062402(x) = sigma(phi(x)) is iterated with initial value=n. a(n) is the length of cycle into which the trajectory merges.

1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 1, 1, 3, 2, 3, 1, 1, 2, 1, 1, 1, 1, 3, 1, 3, 1, 3, 3, 1, 3, 3, 1, 2, 3, 3, 3, 3, 1, 2, 1, 3, 1, 3, 3, 2, 1, 2, 3, 2, 3, 3, 3, 2, 3, 3, 3, 2, 3, 2, 2, 2, 1, 2, 2, 3, 3, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2

Offset: 1

Author

Labos Elemer, Jul 19 2004

Keywords

• nonn

Comments

No 5's present among the first 16384 terms, but they should exist as A095955 has them too. - Antti Karttunen, Dec 04 2017

Links

• Antti Karttunen, Table of n, a(n) for n = 1..16384

Crossrefs

Cf. A062402, A095955, A096864, A096866.

Programs

Scheme

(define (A096993 n) (if (= 1 n) n (let loop ((visited (list n)) (i 1)) (let ((next (A062402 (car visited)))) (cond ((member next visited) => (lambda (prepath) (+ 1 (- i (length prepath))))) (else (loop (cons next visited) (+ 1 i)))))))) ;; Antti Karttunen, Dec 04 2017