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!)
 A325567 a(1) = 1; for n > 1, a(n) is the largest proper divisor d of n such that A048720(A065621(d),n/d) is equal to n. 9
 1, 1, 1, 2, 1, 2, 1, 4, 3, 2, 1, 4, 1, 2, 1, 8, 1, 6, 1, 4, 3, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 16, 11, 2, 5, 12, 1, 2, 1, 8, 1, 6, 1, 4, 3, 2, 1, 16, 7, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 32, 13, 22, 1, 4, 1, 10, 1, 24, 1, 2, 5, 4, 1, 2, 1, 16, 1, 2, 1, 12, 1, 2, 1, 8, 1, 6, 1, 4, 3, 2, 1, 32, 1, 14, 1, 4, 1, 2, 1, 8, 7 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Antti Karttunen, Table of n, a(n) for n = 1..16383 Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537 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)))); CROSSREFS Cf. A032742, A048720, A065621, A115872, A325565, A325566, A325568. Sequence in context: A164879 A200219 A270120 * A009195 A072994 A332741 Adjacent sequences:  A325564 A325565 A325566 * A325568 A325569 A325570 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 22 12:49 EDT 2021. Contains 345380 sequences. (Running on oeis4.)