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 A262907 #7 Oct 11 2015 10:55:27 %S A262907 0,0,1,0,0,0,1,0,0,1,1,2,2,3,3,4,4,5,4,6,5,7,6,8,7,6,8,7,9,8,8,9,8,10, %T A262907 8,11,9,12,10,13,12,14,9,15,13,16,13,17,15,13,16,14,16,15,14,16,14,17, %U A262907 18,18,16,19,17,20,18,21,17,22,15,23,18,24,22,25,20,26,21,27,19,28,23,16,16,19,28,23,23,21,27,22,27,20,20,24,20,17,23,29,29,24,22,28,24,28,30,21 %N A262907 a(n) = number of steps needed to reach a fixed point when starting with k = n, and repeatedly replacing k with k - A262904(k). %H A262907 Antti Karttunen, <a href="/A262907/b262907.txt">Table of n, a(n) for n = 0..65538</a> %F A262907 If A262904(n) = 0 then a(n) = 0, otherwise a(n) = 1 + a(A262906(n)). %o A262907 (Scheme, with memoization-macro definec) %o A262907 (definec (A262907 n) (if (zero? (A262904 n)) 0 (+ 1 (A262907 (A262906 n))))) %Y A262907 Cf. A262904, A262906, A262907. %Y A262907 Cf. also A155043, A262905. %K A262907 nonn %O A262907 0,12 %A A262907 _Antti Karttunen_, Oct 07 2015