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 A091211 #7 Mar 31 2012 14:02:20 %S A091211 2,11,16,21,32,41,55,62,66,71,81,86,91,103,113,121,123,134,142,148, %T A091211 150,163,165,186,190,195,210,215,221,227,229,235,239,249,261,265,270, %U A091211 283,288,298,300,303,307,314,319,327,333,342,350,360,369,376,380,385 %N A091211 A091242-indices of primes that are composite GF(2)[X]-polynomials. %H A091211 A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a> %H A091211 <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a> %Y A091211 a(n) = A091246(A091209(n)). Complement of A091213. %K A091211 nonn %O A091211 1,1 %A A091211 _Antti Karttunen_, Jan 03 2004