login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260427 Binary codes for polynomials (with coefficients 0 or 1) that are irreducible over Q, but reducible over GF(2). 4
5, 17, 23, 29, 43, 53, 69, 71, 77, 79, 81, 83, 89, 101, 107, 113, 121, 127, 139, 149, 151, 163, 169, 173, 179, 181, 197, 199, 205, 209, 223, 227, 233, 251, 257, 261, 263, 265, 269, 271, 275, 277, 281, 289, 293, 295, 305, 307, 311, 317, 321, 323, 327, 329, 331, 337, 339, 347, 349, 353, 359, 367, 373, 377, 383, 389, 401 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..16972

PROG

(PARI)

isA260427(n) = (polisirreducible( Pol(binary(n)) ) && !polisirreducible(Pol(binary(n))*Mod(1, 2)));

n = 0; i = 0; while(n < 65537, n++; if(isA260427(n), i++; write("b260427.txt", i, " ", n)));

CROSSREFS

Intersection of A091242 and A206074.

Subsequence: A260428.

Cf. also A260426, A206075.

Sequence in context: A022141 A322985 A240031 * A091209 A307471 A226671

Adjacent sequences:  A260424 A260425 A260426 * A260428 A260429 A260430

KEYWORD

nonn

AUTHOR

Antti Karttunen, Jul 26 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 16 06:18 EST 2019. Contains 330016 sequences. (Running on oeis4.)