login
a(1) = 1, for n > 1, a(n) = 1 + a(A253889(n)).
6

%I #8 Jan 25 2015 23:22:41

%S 1,2,2,3,3,3,4,3,4,5,4,5,4,4,5,5,4,4,5,5,6,6,4,6,5,5,6,5,6,6,6,5,6,6,

%T 6,7,7,5,6,7,5,7,6,6,7,6,6,6,7,5,7,7,5,7,7,6,7,6,6,7,6,7,5,7,7,7,7,5,

%U 8,8,7,7,7,6,8,8,6,7,8,7,7,8,6,8,7,7,8,6,7,8,8,7,7,7,6,8,8,7,8,8,7,7,7,7,7,8,8,7,8,8,8,8,6,8,8,7,8,8,8,8

%N a(1) = 1, for n > 1, a(n) = 1 + a(A253889(n)).

%H Antti Karttunen, <a href="/A253894/b253894.txt">Table of n, a(n) for n = 1..8192</a>

%F a(1) = 1, for n > 1, a(n) = 1 + a(A253889(n)).

%F a(n) = A070939(A064216(n)). [Binary width of terms of A064216.]

%F a(n) = A253893(n) + 1.

%F a(n) = A254044(n) + A254045(n).

%o (Scheme, with memoization-macro definec)

%o (definec (A253894 n) (if (= 1 n) 1 (+ 1 (A253894 (A253889 n)))))

%o (define (A253894 n) (A070939 (A064216 n))) ;; Alternatively.

%Y One more than A253893.

%Y Sum of A254044 and A254045.

%Y Cf. A064216, A070939, A253889.

%K nonn

%O 1,2

%A _Antti Karttunen_, Jan 22 2015