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 A091229 #8 Mar 02 2023 13:45:53 %S A091229 2,1,0,0,3,2,1,0,3,2,1,0,1,0,5,4,3,2,1,0,5,4,3,2,1,0,5,4,3,2,1,0,5,4, %T A091229 3,2,1,0,3,2,1,0,5,4,3,2,1,0,7,6,5,4,3,2,1,0,3,2,1,0,1,0,5,4,3,2,1,0, %U A091229 5,4,3,2,1,0,13,12,11,10,9,8,7,6,5,4,3,2,1,0,3,2,1,0,5,4,3,2,1,0,5,4 %N A091229 Smallest k such that n+k is irreducible when interpreted as GF(2)[X]-polynomial. %C A091229 Analogous to A007920. %H A091229 A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a> %H A091229 <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a> %F A091229 a(n) = A091228(n) - n. %Y A091229 Cf. A007920, A091228. %K A091229 nonn %O A091229 0,1 %A A091229 _Antti Karttunen_, Jan 03 2004