OFFSET
1,1
COMMENTS
Any subsequent terms are > 10^6. - Lucas A. Brown, Dec 07 2022
PROG
(PARI) isok(n) = polisirreducible(Mod(1, 2)*x^n+(x^8-1)/(x-1)); \\ Michel Marcus, Apr 15 2020
(SageMath) P.<x> = GF(2)[]
from itertools import count
for n in count(8):
print('\b'*42, n, end='', flush=True)
if (x^n + x^7 + x^6 + x^5 + x^4 + x^3 + x^2 + x + 1).is_irreducible(): print() # Lucas A. Brown, Dec 07 2022
CROSSREFS
KEYWORD
nonn,hard
AUTHOR
Robert G. Wilson v, Sep 27 2000
EXTENSIONS
a(17)-a(25) from Jinyuan Wang, Apr 15 2020
a(26)-a(44) from Lucas A. Brown, Dec 07 2022
STATUS
approved