OFFSET
1,2
COMMENTS
Any subsequent terms are > 2 * 10^5. - Lucas A. Brown, Dec 01 2022
PROG
(Sage)
P.<x> = GF(2)[]
for n in range(1, 10^5):
if (x^n * (x+1)^(n-1) + 1).is_irreducible():
print(n)
(PARI) isok(n) = polisirreducible(Mod(1, 2)*x^n * (x+1)^(n-1) + 1); \\ Michel Marcus, Mar 03 2016
CROSSREFS
KEYWORD
nonn,more,hard
AUTHOR
Joerg Arndt, Mar 02 2016
EXTENSIONS
a(26) from Lucas A. Brown, Dec 01 2022
STATUS
approved