|
%I #11 Dec 24 2019 17:31:09
%S 0,1,2,2,3,3,4,4,3,5,3,5,4,6,4,6,5,7,5,4,7,4,4,6,8,6,5,8,5,5,7,9,7,6,
%T 9,6,6,4,8,10,5,8,5,5,7,10,7,7,5,9,11,6,9,5,6,6,8,11,8,8,6,10,12,7,10,
%U 6,7,7,5,9,12,5,6,9,9,7,6,11,6,13,8,11,7,8,8,6,10,13,6,7,10,10,6,8,7,12,7,14,9,12,8,9,9,7,11
%N Number of iterations of A329904 needed to reach 1.
%C Equally, starting from A025487(n), number of iterations of A329899 needed to reach 1.
%C Any k > 0 occurs 2^(k-1) times in total in this sequence.
%H Antti Karttunen, <a href="/A329907/b329907.txt">Table of n, a(n) for n = 1..10000</a>
%F a(1) = 0; for n > 1, a(n) = 1 + a(A329904(n)).
%F a(1) = 0; for n > 1, a(n) = A070939(A329905(n)).
%F a(n) = A252464(A181815(n)).
%F For all n >= 1, a(n) >= A061394(n).
%o (PARI) A329907(n) = if(1==n,0,1+A329907(A329904(n)));
%o (PARI) A329907(n) = #binary(A329905(n));
%Y Cf. A025487, A061394, A070939, A181815, A252464, A329899, A329904, A329905.
%K nonn
%O 1,3
%A _Antti Karttunen_, Dec 24 2019
|
