cp's OEIS Frontend

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.

A057477 Numbers k such that x^k + x^7 + 1 is irreducible over GF(2).

This page as a plain text file.
%I A057477 #15 Nov 29 2022 01:19:36
%S A057477 1,3,4,6,10,12,15,18,21,25,31,34,42,52,55,57,105,127,172,210,220,300,
%T A057477 393,420,441,492,772,807,972,1023,1071,1266,1564,2220,2242,3297,3585,
%U A057477 5314,6300,7306,8719,10777,23647,26119,33127,44247,48036,48945,59172,68841
%N A057477 Numbers k such that x^k + x^7 + 1 is irreducible over GF(2).
%C A057477 The b-file contains all terms <= 300000. - _Lucas A. Brown_, Nov 28 2022
%H A057477 Lucas A. Brown, <a href="/A057477/b057477.txt">Table of n, a(n) for n = 1..58</a>
%H A057477 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.py">Python program</a>.
%H A057477 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.sage">Sage program</a>.
%o A057477 (PARI) is(k) = polisirreducible(Mod(1, 2)*(x^k + x^7 + 1)); \\ _Jinyuan Wang_, Apr 15 2020
%Y A057477 Cf. A002475.
%K A057477 nonn
%O A057477 1,2
%A A057477 _Robert G. Wilson v_, Sep 27 2000
%E A057477 a(27)-a(40) from _Jinyuan Wang_, Apr 15 2020
%E A057477 a(41)-a(58) from _Lucas A. Brown_, Nov 28 2022