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 A091226 #7 Mar 31 2012 14:02:20 %S A091226 0,0,1,2,2,2,2,3,3,3,3,4,4,5,5,5,5,5,5,6,6,6,6,6,6,7,7,7,7,7,7,8,8,8, %T A091226 8,8,8,9,9,9,9,10,10,10,10,10,10,11,11,11,11,11,11,11,11,12,12,12,12, %U A091226 13,13,14,14,14,14,14,14,15,15,15,15,15,15,16,16,16,16,16,16,16,16,16 %N A091226 Number of irreducible GF(2)[X]-polynomials in range [0,n]. %C A091226 Analogous to A000720. %H A091226 A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a> %H A091226 <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a> %Y A091226 Partial sums of A091225. A062692(n) = a(2^n). %K A091226 nonn %O A091226 0,4 %A A091226 _Antti Karttunen_, Jan 03 2004