This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A325566 #7 May 11 2019 02:23:45 %S A325566 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, %T A325566 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, %U A325566 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 %N A325566 a(n) is the largest divisor d of n such that A048720(A065621(d),n/d) = n. %H A325566 Antti Karttunen, <a href="/A325566/b325566.txt">Table of n, a(n) for n = 1..16383</a> %H A325566 Antti Karttunen, <a href="/A325566/a325566.txt">Data supplement: n, a(n) computed for n = 1..65537</a> %o A325566 (PARI) %o A325566 A048720(b,c) = fromdigits(Vec(Pol(binary(b))*Pol(binary(c)))%2, 2); %o A325566 A065621(n) = bitxor(n-1,n+n-1); %o A325566 A325566(n) = fordiv(n,d,if(A048720(A065621(n/d),d)==n,return(n/d))); %Y A325566 Cf. A048720, A065621, A325565, A325567, A325570 (positions of ones). %K A325566 nonn %O A325566 1,2 %A A325566 _Antti Karttunen_, May 09 2019