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 A344177 #33 May 18 2021 08:44:36 %S A344177 6,12,18,66,180,1596,2700,4098,30594,65538 %N A344177 Numbers m > 3 such that x^m + x^3 + 1 is irreducible over GF(2) while x^m + x^3 + x^2 + x + 1 = x^m + (x + 1)^3 is not. %C A344177 Numbers m >= 4 that are in A057461 but not in A057496. %C A344177 In A057496 it is stated that if x^m + x^3 + x^2 + x + 1 is irreducible, then so is x^m + x^3 + 1. It seems that if x^m + x^3 + 1 is irreducible and m is not a multiple of 6, then so is x^m + x^3 + x^2 + x + 1. In other words, it seems that this sequence consists of the terms in A057461 that are multiples of 6. %C A344177 Conjecture: Given e >= 0, odd numbers r, k > 0, a > 2^e*r*k, consider the following two statements: %C A344177 (A) x^m + (x^k + 1)^(2^e*r) is irreducible over GF(2); %C A344177 (B) x^m + x^(2^e*r*k) + 1 is irreducible over GF(2), %C A344177 then: %C A344177 (i) (A) implies (B); %C A344177 (ii) if (B) is true and (A) is false, then: %C A344177 (a) gcd(m,r) > 1; %C A344177 (b) if prime p | gcd(m,r*k), then p*ord_p(2) | m; %C A344177 (c) if e > 0, then m is odd. %C A344177 Here ord(2,p) is the multiplicative order of 2 modulo p. %C A344177 In other words, assuming that (B) is true, (A) is false if and only if (a), (b), (c) hold. (For the "if" part, note that if d = gcd(m,2^e*r) > 1 then x^m + (x^k + 1)^(2^e*r) must be reducible, since it is divisible by x^(m/d) + (x^k + 1)^(2^e*r/d).) %C A344177 Here is the case r = 3, k = 1, e = 0, and (ii) means that m is in this sequence if and only if x^m + x^3 + 1 is irreducible and m is a multiple of 6. %e A344177 18 is a term because x^18 + x^3 + 1 is irreducible over GF(2) but x^18 + x^3 + x^2 + x + 1 is not: x^18 + x^3 + x^2 + x + 1 = (x^2 + x + 1)*(x^6 + x + 1)*(x^10 + x^9 + x^7 + x^6 + x^5 + x^4 + x^2 + x + 1). %o A344177 (PARI) isA344177(n) = polisirreducible(Mod(x^n+x^3+1, 2)) && !polisirreducible(Mod(x^n+x^3+x^2+x+1, 2)) %Y A344177 Cf. A057461, A057496. %Y A344177 Similar sequences: this sequence (r=3, k=1), A344198 (r=3, k=3), A344199 (r=3, k=5), A344197 (r=5, k=1), A344200 (r=5, k=3). %K A344177 nonn,hard,more %O A344177 1,1 %A A344177 _Jianing Song_, May 11 2021