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