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 A262905 #7 Oct 11 2015 10:54:53 %S A262905 0,1,2,1,1,1,3,1,1,3,3,3,2,3,3,3,3,3,2,3,3,3,2,3,3,2,2,3,2,3,4,3,2,3, %T A262905 2,3,3,3,2,3,2,3,2,3,2,3,4,3,2,4,2,3,4,3,4,3,2,3,4,3,2,3,3,3,3,3,4,3, %U A262905 3,3,4,3,2,3,4,3,4,3,4,3,4,4,4,4,2,4,4,4,4,4,4,4,4,4,4,4,2,4,4,4,4,4,4,4,2,4,3,4,2,4,4,4,4,4,4,4,4,4,4,4,2,4 %N A262905 a(n) = number of steps needed to reach zero when starting with k = n, and repeatedly replacing k with A262904(k). %H A262905 Antti Karttunen, <a href="/A262905/b262905.txt">Table of n, a(n) for n = 0..65538</a> %F A262905 a(0) = 0; and for n >= 1, a(n) = 1 + a(A262904(n)). %o A262905 (Scheme, with memoization-macro definec) %o A262905 (definec (A262905 n) (if (zero? n) n (+ 1 (A262905 (A262904 n))))) %Y A262905 Cf. A262904, A262907. %K A262905 nonn %O A262905 0,3 %A A262905 _Antti Karttunen_, Oct 07 2015