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 A057481 #12 Nov 29 2022 04:44:39 %S A057481 2,9,15,17,18,36,60,63,84,95,98,135,156,170,186,218,540,641,660,879, %T A057481 1388,1820,1866,1943,2055,2388,3423,3983,6090,6713,9900,14610,18330, %U A057481 18855,22346,26180,32855,36410,43911,44465,82652,88764,131250,154644,231420 %N A057481 Numbers n such that x^n + x^11 + 1 is irreducible over GF(2). %C A057481 Any subsequent terms are > 300000. %H A057481 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.py">Python program</a>. %H A057481 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.sage">Sage program</a>. %o A057481 (PARI) is(k) = polisirreducible(Mod(1, 2)*(x^k + x^11 + 1)); \\ _Jinyuan Wang_, Apr 15 2020 %Y A057481 Cf. A002475. %K A057481 nonn %O A057481 1,1 %A A057481 _Robert G. Wilson v_, Sep 27 2000 %E A057481 a(20)-a(28) from _Jinyuan Wang_, Apr 15 2020 %E A057481 a(29)-a(45) from _Lucas A. Brown_, Nov 29 2022