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 A091246 #7 Mar 31 2012 14:02:20 %S A091246 0,0,0,1,2,3,0,4,5,6,0,7,0,8,9,10,11,12,0,13,14,15,16,17,0,18,19,20, %T A091246 21,22,0,23,24,25,26,27,0,28,29,30,0,31,32,33,34,35,0,36,37,38,39,40, %U A091246 41,42,0,43,44,45,0,46,0,47,48,49,50,51,0,52,53,54,55,56,0,57,58,59 %N A091246 Inverse function of A091242: position in A091242 if the n-th GF(2)[X] polynomial is reducible, 0 otherwise. %C A091246 Analogous to A066246. %H A091246 A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a> %H A091246 <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a> %F A091246 a(n) = A091245(n) * A091247(n). %Y A091246 Inverse of A091242. %K A091246 nonn %O A091246 1,5 %A A091246 _Antti Karttunen_, Jan 03 2004