|
|
A268274
|
|
Numbers n such that x^n * (x+1)^(n-1) + 1 is irreducible over GF(2).
|
|
0
|
|
|
1, 2, 3, 4, 5, 8, 21, 32, 33, 36, 53, 64, 85, 89, 148, 312, 404, 3080, 8380, 11684, 16384, 18089, 21096, 53492, 78484, 192248
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
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
|
Cf. A162570 (corresponding to powers of 2 in this sequence).
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|