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!)
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
Any subsequent terms are > 2 * 10^5. - Lucas A. Brown, Dec 01 2022
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).
Sequence in context: A057657 A293591 A116657 * A079383 A103670 A289081
KEYWORD
nonn,more,hard
AUTHOR
Joerg Arndt, Mar 02 2016
EXTENSIONS
a(26) from Lucas A. Brown, Dec 01 2022
STATUS
approved

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 23 02:23 EDT 2024. Contains 371906 sequences. (Running on oeis4.)