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 A261104 #8 Oct 02 2015 12:05:27 %S A261104 0,1,1,2,2,2,2,3,3,3,3,4,3,4,4,4,4,5,4,5,5,5,5,6,5,6,5,6,6,6,6,7,6,7, %T A261104 6,7,7,7,7,7,8,7,8,7,8,8,8,8,8,8,9,8,9,8,9,9,9,9,9,9,9,9,10,9,10,9,10, %U A261104 10,10,10,10,10,10,10,11,10,11,10,11,11,11,11,11,11,11,11,12,11,12,11,12,12,12,12,12,12,12,12,13,12,13,12,13,13,13,13,13,13,13,13,14,13,14,13,14,14,14,14,14,14,14,14 %N A261104 a(0)=0; for n >= 1, a(n) = 1 + a(n-A070319(n)), where A070319(n) is the maximum value for A000005 (number of divisors) in range 1 .. n. %C A261104 Number of steps needed to reach zero when starting from k = n and repeatedly applying the map that replaces k by k - A070319(k), where A070319(k) is the maximum value for A000005 (number of divisors) in range 1 .. k. %H A261104 Antti Karttunen, <a href="/A261104/b261104.txt">Table of n, a(n) for n = 0..10080</a> %F A261104 a(0)=0; for n >= 1, a(n) = 1 + a(n-A070319(n)). %F A261104 Other identities. For all n >= 0: %F A261104 a(A262502(n)) = n. %o A261104 (Scheme, with memoizing macro definec) %o A261104 (definec (A261104 n) (if (zero? n) n (+ 1 (A261104 (- n (A070319 n)))))) %Y A261104 Cf. A155043, A070319. %Y A261104 Cf. A262502 (positions of records). %K A261104 nonn %O A261104 0,4 %A A261104 _Antti Karttunen_, Sep 24 2015