cp's OEIS Frontend

A256993 a(1) = 0; for n > 1, a(n) = 1 + a(A256992(n)).

%I A256993 #23 Dec 12 2016 09:11:28
%S A256993 0,1,2,3,2,3,4,3,4,4,5,3,4,5,4,5,4,5,6,5,5,4,5,6,6,5,4,5,6,5,6,5,6,6,
%T A256993 7,5,6,6,6,7,5,6,6,6,5,7,7,6,6,5,7,7,6,7,6,6,7,5,6,7,6,7,6,7,6,7,8,7,
%U A256993 7,6,7,8,7,7,6,7,7,8,6,7,7,7,8,6,7,6,7,8,8,7,7,6,8,7,7,8,6,8,7,7,8,7,6,8,7,8,8,7,7,8,8,6,7,7,7,8,7,8,8,7,6,7,8,7,8,7,8,7
%N A256993 a(1) = 0; for n > 1, a(n) = 1 + a(A256992(n)).
%C A256993 Number of iterations of A256992 needed to reach one when starting from n.
%H A256993 Antti Karttunen, <a href="/A256993/b256993.txt">Table of n, a(n) for n = 1..8192</a>
%F A256993 a(1) = 0; for n > 1, a(n) = 1 + a(A256992(n)).
%F A256993 Other observations. For all n >= 1 it holds that:
%F A256993 a(n) >= A254110(n).
%F A256993 a(n) >= A256989(n).
%F A256993 a(n) >= A255559(n)-1.
%F A256993 Also it seems that a(n) - A070939(n) = -1, 0 or +1 for all n >= 1. [Compare A256991 and A256992 to see the connection.]
%F A256993 It is also very likely that a(n) <= A071542(n) for all n.
%F A256993 From _Antti Karttunen_, Dec 10 2016: (Start)
%F A256993 For all n >= 2, a(n) = A070939(A279341(n)) = A070939(A279343(n)).
%F A256993 For all n >= 2, a(n) = A279345(n) + A279346(n) - 1.
%F A256993 (End)
%o A256993 (Scheme, with memoization macro definec)
%o A256993 (definec (A256993 n) (if (= 1 n) 0 (+ 1 (A256993 (A256992 n)))))
%Y A256993 Cf. A070939, A071542, A254110, A255559, A256991, A256992, A257264, A257265, A279341, A279343, A279345, A279346.
%K A256993 nonn
%O A256993 1,3
%A A256993 _Antti Karttunen_, Apr 15 2015