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 A091228 #6 Mar 31 2012 14:02:20 %S A091228 2,2,2,3,7,7,7,7,11,11,11,11,13,13,19,19,19,19,19,19,25,25,25,25,25, %T A091228 25,31,31,31,31,31,31,37,37,37,37,37,37,41,41,41,41,47,47,47,47,47,47, %U A091228 55,55,55,55,55,55,55,55,59,59,59,59,61,61,67,67,67,67,67,67,73,73,73 %N A091228 Smallest m >= n, such that m is irreducible when interpreted as GF(2)[X]-polynomial. %C A091228 Analogous to A007918. %H A091228 A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a> %H A091228 <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a> %F A091228 a(n) = n + A091229(n). %K A091228 nonn %O A091228 0,1 %A A091228 _Antti Karttunen_, Jan 03 2004