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 A057483 #12 Nov 29 2022 04:44:55 %S A057483 28,31,33,84,87,103,174,414,574,687,780,1111,1449,1860,6964,7708, %T A057483 11700,17428,19398,19876,78391,131305,136564,181684 %N A057483 Numbers n such that x^n + x^13 + 1 is irreducible over GF(2). %C A057483 Any subsequent terms are > 300000. %H A057483 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.py">Python program</a>. %H A057483 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.sage">Sage program</a>. %o A057483 (PARI) is(k) = polisirreducible(Mod(1, 2)*(x^k + x^13 + 1)); \\ _Jinyuan Wang_, Apr 15 2020 %Y A057483 Cf. A002475. %K A057483 nonn,more %O A057483 1,1 %A A057483 _Robert G. Wilson v_, Sep 27 2000 %E A057483 a(11)-a(14) from _Jinyuan Wang_, Apr 15 2020 %E A057483 a(15)-a(24) from _Lucas A. Brown_, Nov 29 2022