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 A091244 #6 Mar 31 2012 14:02:20 %S A091244 0,0,1,0,0,1,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,0,0, %T A091244 1,0,0,0,0,0,0,1,0,0,1,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0, %U A091244 1,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0 %N A091244 Number of irreducible polynomials between successive reducible GF(2)[X]-polynomials. %C A091244 Analogous to A073784. %H A091244 A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a> %H A091244 <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a> %Y A091244 Cf. A091243(n)-1. %K A091244 nonn %O A091244 1,1 %A A091244 _Antti Karttunen_, Jan 03 2004