A262907 - OEIS

%I #7 Oct 11 2015 10:55:27

%S 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 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 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 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 Antti Karttunen, <a href="/A262907/b262907.txt">Table of n, a(n) for n = 0..65538</a>

%F If A262904(n) = 0 then a(n) = 0, otherwise a(n) = 1 + a(A262906(n)).

%o (Scheme, with memoization-macro definec)

%o (definec (A262907 n) (if (zero? (A262904 n)) 0 (+ 1 (A262907 (A262906 n)))))

%Y Cf. A262904, A262906, A262907.

%Y Cf. also A155043, A262905.

%K nonn

%O 0,12

%A _Antti Karttunen_, Oct 07 2015