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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A325568 a(1) = 0; for n > 1, a(n) = 1 + a(A325567(n)). 5
 0, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 2, 1, 4, 1, 3, 1, 3, 2, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 5, 2, 2, 2, 4, 1, 2, 1, 4, 1, 3, 1, 3, 2, 2, 1, 5, 2, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 6, 2, 3, 1, 3, 1, 3, 1, 5, 1, 2, 2, 3, 1, 2, 1, 5, 1, 2, 1, 4, 1, 2, 1, 4, 1, 3, 1, 3, 2, 2, 1, 6, 1, 3, 1, 3, 1, 2, 1, 4, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(1) = 0; for n > 1, a(n) = 1 + a(A325567(n)). a(n) <= A001222(n) for all n. PROG (PARI) A048720(b, c) = fromdigits(Vec(Pol(binary(b))*Pol(binary(c)))%2, 2); A065621(n) = bitxor(n-1, n+n-1); A325567(n) = if(1==n, n, fordiv(n, d, if((d>1)&&A048720(A065621(n/d), d)==n, return(n/d)))); A325568(n) = if(1==n, 0, 1+A325568(A325567(n))); CROSSREFS Cf. A001222, A048720, A065621, A115872, A325565, A325566, A325567, A325569. Sequence in context: A305302 A340382 A055181 * A326195 A073811 A125030 Adjacent sequences: A325565 A325566 A325567 * A325569 A325570 A325571 KEYWORD nonn AUTHOR Antti Karttunen, May 09 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 12 22:36 EDT 2024. Contains 371639 sequences. (Running on oeis4.)