This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A096993 #12 Dec 04 2017 18:36:04 %S A096993 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, %T A096993 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, %U A096993 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 %N 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. %C A096993 No 5's present among the first 16384 terms, but they should exist as A095955 has them too. - _Antti Karttunen_, Dec 04 2017 %H A096993 Antti Karttunen, <a href="/A096993/b096993.txt">Table of n, a(n) for n = 1..16384</a> %o A096993 (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 %Y A096993 Cf. A062402, A095955, A096864, A096866. %K A096993 nonn %O A096993 1,5 %A A096993 _Labos Elemer_, Jul 19 2004