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 A057474 #32 Jan 30 2025 11:22:04 %S A057474 2,3,6,9,12,14,17,20,23,44,47,63,84,129,236,278,279,297,300,647,726, %T A057474 737,2574,2660,4233,4500,8207,11900,16046,21983,23999,24596,24849, %U A057474 84929,130926,156308,160046,185142,270641 %N A057474 Numbers k such that x^k + x^5 + 1 is irreducible over GF(2). %C A057474 Any subsequent terms are > 300000. - _Lucas A. Brown_, Nov 28 2022 %H A057474 Joerg Arndt, <a href="http://www.jjj.de/fxt/#fxtbook">Matters Computational (The Fxtbook)</a>, section 40.9.3 "Irreducible trinomials of the form 1 + x^k + x^d", p.850 %H A057474 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.py">Python program</a>. %H A057474 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.sage">Sage program</a>. %o A057474 (Sage) %o A057474 P.<x> = GF(2)[] %o A057474 for n in range(10^4): %o A057474 if (x^n+x^5+1).is_irreducible(): %o A057474 print(n) # _Joerg Arndt_, Apr 28 2012 %Y A057474 Cf. A002475. %K A057474 nonn,hard,more %O A057474 1,1 %A A057474 _Robert G. Wilson v_, Sep 27 2000 %E A057474 a(23)-a(34) by _Joerg Arndt_, Apr 28 2012 %E A057474 a(35)-a(38) by _Manfred Scheucher_, Aug 18 2015 %E A057474 a(39) from _Lucas A. Brown_, Nov 28 2022