|
%I #8 Oct 02 2015 12:05:27
%S 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 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 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 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 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 Antti Karttunen, <a href="/A261104/b261104.txt">Table of n, a(n) for n = 0..10080</a>
%F a(0)=0; for n >= 1, a(n) = 1 + a(n-A070319(n)).
%F Other identities. For all n >= 0:
%F a(A262502(n)) = n.
%o (Scheme, with memoizing macro definec)
%o (definec (A261104 n) (if (zero? n) n (+ 1 (A261104 (- n (A070319 n))))))
%Y Cf. A155043, A070319.
%Y Cf. A262502 (positions of records).
%K nonn
%O 0,4
%A _Antti Karttunen_, Sep 24 2015
|
