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 A325634 #8 May 21 2019 22:03:19 %S A325634 1,1,1,1,3,6,1,1,1,6,1,4,1,2,3,1,3,3,1,2,1,2,3,12,1,2,5,28,3,6,1,1,3, %T A325634 10,1,1,1,2,1,10,1,2,1,4,5,6,1,4,1,1,3,2,3,10,1,8,5,6,1,4,1,2,1,1,21, %U A325634 6,1,6,1,14,3,9,1,2,1,4,3,2,1,2,1,2,7,28,5,6,1,4,3,2,1,4,1,2,5,12,1,1,5,1,3,10,1,2,3 %N A325634 a(n) = A091255(n, sigma(n)). %H A325634 Antti Karttunen, <a href="/A325634/b325634.txt">Table of n, a(n) for n = 1..65537</a> %H A325634 <a href="/index/Ge#GF2X">Index entries for sequences related to polynomials in ring GF(2)[X]</a> %H A325634 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a> %F A325634 a(n) = A091255(n, A000203(n)). %F A325634 a(n) = A091255(n, A169813(n)) = A091255(A000203(n), A169813(n)). %o A325634 (PARI) %o A325634 A091255sq(a,b) = fromdigits(Vec(lift(gcd(Pol(binary(a))*Mod(1, 2),Pol(binary(b))*Mod(1, 2)))),2); %o A325634 A325634(n) = A091255sq(n, sigma(n)); %Y A325634 Cf. A000203, A009194, A091255, A169813, A325632, A325633, A325635, A325639 (fixed points, n such that a(n) = n). %K A325634 nonn %O A325634 1,5 %A A325634 _Antti Karttunen_, May 21 2019