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 A305802 #13 Jul 02 2018 07:03:14 %S A305802 0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,3,0,0,1,0,0,1,0,-1,0,0,0,1,1,0,0,0,3, %T A305802 0,0,0,0,1,1,0,0,1,0,1,1,0,0,0,-1,3,0,1,0,-1,0,1,1,0,1,0,0,0,0,2,0,0, %U A305802 3,0,0,1,0,0,0,1,0,0,1,1,1,-2,0,2,0,4,1,-1,0,1,1,-1,1,0,0,1,0,0,0,0,-1,2,3,0,0,1 %N A305802 Difference in number of prime factors (when counted with multiplicity) between GF(2)[X] (carryless binary) and ordinary factorization: a(n) = A091222(n) - A001222(n). %H A305802 Antti Karttunen, <a href="/A305802/b305802.txt">Table of n, a(n) for n = 1..65537</a> %H A305802 <a href="/index/Ge#GF2X">Index entries for sequences operating on polynomials in ring GF(2)[X]</a> %F A305802 a(n) = A091222(n) - A001222(n). %F A305802 For all n, a(A091206(n)) = 0. [Note that zeros occur in other positions as well.] %o A305802 (PARI) %o A305802 A091222(n) = vecsum(factor(Pol(binary(n))*Mod(1, 2))[, 2]); %o A305802 A305802(n) = (A091222(n) - bigomega(n)); %Y A305802 Cf. A001222, A091222, A091206, A305816. %Y A305802 Cf. also A305789. %K A305802 sign %O A305802 1,17 %A A305802 _Antti Karttunen_, Jun 10 2018