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 A091254 #6 Mar 31 2012 14:02:20 %S A091254 100,101,110,1000,1001,1010,1100,1110,1111,10000,10001,10010,10100, %T A091254 10101,10110,10111,11000,11010,11011,11100,11101,11110,100000,100001, %U A091254 100010,100011,100100,100110,100111,101000,101010,101011,101100 %N A091254 Reducible polynomials over GF(2) in binary format. %H A091254 A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a> %H A091254 <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a> %Y A091254 a(n) = A007088(A091242(n)). Cf. A058943. %K A091254 nonn %O A091254 1,1 %A A091254 _Antti Karttunen_, Jan 03 2004