login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A322996 Number of iterations of A049820(x) = x - A000005(x) needed to reach an odd number or zero, when starting from x = n. 6

%I #13 Jan 07 2019 11:12:58

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

%T 7,0,1,0,8,0,8,0,8,0,9,0,9,0,9,0,10,0,10,0,10,0,10,0,11,0,10,0,12,0,1,

%U 0,12,0,13,0,13,0,11,0,14,0,14,0,14,0,14,0,15,0,12,0,16,0,15,0,15,0,17,0,16,0,13,0,18,0,1,0,17,0,14,0

%N Number of iterations of A049820(x) = x - A000005(x) needed to reach an odd number or zero, when starting from x = n.

%H Antti Karttunen, <a href="/A322996/b322996.txt">Table of n, a(n) for n = 0..16384</a>

%H Antti Karttunen, <a href="/A322996/a322996.txt">Data supplement: n, a(n) computed for n = 1..110880</a>

%F a(0) = 0; for n >= 1, for n odd, a(n) = 0, and for n even, a(n) = 1 + a(n-A000005(n)).

%F a(n) <= A155043(n).

%F For n >= 83, a(2*n) = 1+A322987(2*n).

%o (PARI) A322996(n) = if((!n)||(n%2),0,1+A322996(n-numdiv(n)));

%o (PARI) A322996(n) = { for(j=0,oo,if((!n)||(n%2),return(j)); n -= numdiv(n)); };

%Y Cf. A000005, A049820, A155043, A259934, A322987, A322997 (bisection), A323073.

%Y Cf. also A322983.

%K nonn

%O 0,7

%A _Antti Karttunen_, Jan 05 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 03:51 EDT 2024. Contains 371264 sequences. (Running on oeis4.)