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 A057460 #26 Nov 29 2022 01:18:56
%S A057460 1,3,5,11,21,29,35,93,123,333,845,4125,10437,10469,14211,20307,34115,
%T A057460 47283,50621,57341,70331,80141
%N A057460 Numbers k such that x^k + x^2 + 1 is irreducible over GF(2).
%C A057460 Any subsequent terms are > 300000. - _Lucas A. Brown_, Nov 28 2022
%H A057460 Joerg Arndt, <a href="http://www.jjj.de/fxt/#fxtbook">Matters Computational (The Fxtbook)</a>
%H A057460 I. F. Blake, S. Gao and R. J. Lambert, <a href="http://dx.doi.org/10.1007/3-540-57936-2_27">Constructive problems for irreducible polynomials over finite fields</a>, in Information Theory and Applications, LNCS 793, Springer-Verlag, Berlin, 1994, 1-23, See Table 2.
%H A057460 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.py">Python program</a>.
%H A057460 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.sage">Sage program</a>.
%H A057460 H. Fredricksen, R. Wisniewski, <a href="http://dx.doi.org/10.1016/S0019-9958(81)90144-3">On trinomials x^n + x^2 + 1 and x^{8l+-1} + x^k + 1 irreducible overGF(2)</a>, Inform. and Control 50 (1981), no. 1, 58--63. MR0665139 (84i:12013). Gives first 20 terms.
%H A057460 <a href="/index/Tri#trinomial">Index entries for sequences related to trinomials over GF(2)</a>
%o A057460 (PARI) isok(n) = polisirreducible(Mod(1,2)*(x^n + x^2 + 1)); \\ _Michel Marcus_, Aug 23 2015
%Y A057460 Cf. A002475, A074710.
%K A057460 nonn,more
%O A057460 1,2
%A A057460 _Robert G. Wilson v_, Sep 27 2000
%E A057460 Confirmed by _Richard P. Brent_, Sep 05 2002
%E A057460 a(21) and a(22) from _Lucas A. Brown_, Nov 28 2022