login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057477 Numbers k such that x^k + x^7 + 1 is irreducible over GF(2). 2

%I #15 Nov 29 2022 01:19:36

%S 1,3,4,6,10,12,15,18,21,25,31,34,42,52,55,57,105,127,172,210,220,300,

%T 393,420,441,492,772,807,972,1023,1071,1266,1564,2220,2242,3297,3585,

%U 5314,6300,7306,8719,10777,23647,26119,33127,44247,48036,48945,59172,68841

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

%C The b-file contains all terms <= 300000. - _Lucas A. Brown_, Nov 28 2022

%H Lucas A. Brown, <a href="/A057477/b057477.txt">Table of n, a(n) for n = 1..58</a>

%H Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.py">Python program</a>.

%H Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/irred_trinom_f2.sage">Sage program</a>.

%o (PARI) is(k) = polisirreducible(Mod(1, 2)*(x^k + x^7 + 1)); \\ _Jinyuan Wang_, Apr 15 2020

%Y Cf. A002475.

%K nonn

%O 1,2

%A _Robert G. Wilson v_, Sep 27 2000

%E a(27)-a(40) from _Jinyuan Wang_, Apr 15 2020

%E a(41)-a(58) from _Lucas A. Brown_, Nov 28 2022

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 07:50 EDT 2024. Contains 371922 sequences. (Running on oeis4.)