The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 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
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 LINKS Antti Karttunen, Table of n, a(n) for n = 0..16384 Antti Karttunen, Data supplement: n, a(n) computed for n = 1..110880 FORMULA a(0) = 0; for n >= 1, for n odd, a(n) = 0, and for n even, a(n) = 1 + a(n-A000005(n)). a(n) <= A155043(n). For n >= 83, a(2*n) = 1+A322987(2*n). PROG (PARI) A322996(n) = if((!n)||(n%2), 0, 1+A322996(n-numdiv(n))); (PARI) A322996(n) = { for(j=0, oo, if((!n)||(n%2), return(j)); n -= numdiv(n)); }; CROSSREFS Cf. A000005, A049820, A155043, A259934, A322987, A322997 (bisection), A323073. Cf. also A322983. Sequence in context: A318979 A172441 A053399 * A242096 A284965 A274101 Adjacent sequences:  A322993 A322994 A322995 * A322997 A322998 A322999 KEYWORD nonn AUTHOR Antti Karttunen, Jan 05 2019 STATUS approved

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

Last modified September 18 04:44 EDT 2020. Contains 337165 sequences. (Running on oeis4.)