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 A057479 #18 Nov 29 2022 01:19:50 %S A057479 1,4,5,8,11,12,14,18,23,28,30,36,49,54,60,68,71,79,84,103,113,151,156, %T A057479 191,198,364,390,470,476,508,540,620,721,823,865,1135,1558,1825,1950, %U A057479 4225,4788,8100,12294,12553,14686,18516,19660,24470,30486,32086,43908 %N A057479 Numbers k such that x^k + x^9 + 1 is irreducible over GF(2). %C A057479 The b-file contains all terms <= 300000. - _Lucas A. Brown_, Nov 28 2022 %H A057479 Lucas A. Brown, <a href="/A057479/b057479.txt">Table of n, a(n) for n = 1..67</a> %H A057479 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.py">Python program</a>. %H A057479 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.sage">Sage program</a>. %p A057479 select(n -> Irreduc(x^n + x^9 + 1) mod 2, [$1..1000]); # _Robert Israel_, Oct 20 2016 %o A057479 (PARI) isok(n) = polisirreducible(Mod(1,2)*(x^n + x^9 + 1)); \\ _Michel Marcus_, Oct 20 2016 %Y A057479 Cf. A002475. %K A057479 nonn %O A057479 1,2 %A A057479 _Robert G. Wilson v_, Sep 27 2000 %E A057479 a(34)-a(41) from _Robert Israel_, Oct 20 2016 %E A057479 a(42) from _Alois P. Heinz_, Oct 20 2016 %E A057479 a(43)-a(67) from _Lucas A. Brown_, Nov 28 2022