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 A294881 #10 Nov 11 2017 12:04:54
%S A294881 0,0,0,1,0,2,0,1,1,1,0,2,0,2,1,1,0,2,0,1,2,2,0,2,0,2,1,2,0,2,0,1,2,1,
%T A294881 1,2,0,2,2,1,0,3,0,2,1,1,0,2,1,2,1,2,0,2,1,2,2,1,0,2,0,2,2,1,1,3,0,1,
%U A294881 1,2,0,2,0,2,2,2,2,3,0,1,1,2,0,3,0,1,1,2,0,2,2,1,2,2,1,2,0,2,2,2,0,2,0,2,2
%N A294881 Number of proper divisors of n that are irreducible when their binary expansion is interpreted as polynomial over GF(2).
%H A294881 Antti Karttunen, <a href="/A294881/b294881.txt">Table of n, a(n) for n = 1..21845</a>
%H A294881 <a href="/index/Ge#GF2X">Index entries for sequences related to polynomials in ring GF(2)[X]</a>
%F A294881 a(n) = Sum_{d|n, d < n} A091225(d).
%F A294881 a(n) + A294882(n) = A032741(n).
%F A294881 a(n) = A294883(n) - A091225(n).
%o A294881 (PARI) A294881(n) = sumdiv(n,d,(d<n) * polisirreducible(Mod(1, 2) * Pol(binary(d))));
%Y A294881 Cf. A032741, A091225, A294882, A294883.
%Y A294881 Cf. also A234741, A234742, A294891.
%K A294881 nonn
%O A294881 1,6
%A A294881 _Antti Karttunen_, Nov 09 2017