login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A325566
a(n) is the largest divisor d of n such that A048720(A065621(d),n/d) = n.
8
1, 2, 1, 4, 1, 2, 1, 8, 3, 2, 1, 4, 1, 2, 1, 16, 1, 6, 1, 4, 3, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 32, 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, 64, 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
OFFSET
1,2
PROG
(PARI)
A048720(b, c) = fromdigits(Vec(Pol(binary(b))*Pol(binary(c)))%2, 2);
A065621(n) = bitxor(n-1, n+n-1);
A325566(n) = fordiv(n, d, if(A048720(A065621(n/d), d)==n, return(n/d)));
CROSSREFS
Cf. A048720, A065621, A325565, A325567, A325570 (positions of ones).
Sequence in context: A076775 A357689 A324873 * A218621 A079891 A108738
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 09 2019
STATUS
approved