The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091211 A091242-indices of primes that are composite GF(2)[X]-polynomials. 2
 2, 11, 16, 21, 32, 41, 55, 62, 66, 71, 81, 86, 91, 103, 113, 121, 123, 134, 142, 148, 150, 163, 165, 186, 190, 195, 210, 215, 221, 227, 229, 235, 239, 249, 261, 265, 270, 283, 288, 298, 300, 303, 307, 314, 319, 327, 333, 342, 350, 360, 369, 376, 380, 385 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Table of n, a(n) for n=1..54. A. Karttunen, Scheme-program for computing this sequence. Index entries for sequences operating on GF(2)[X]-polynomials CROSSREFS a(n) = A091246(A091209(n)). Complement of A091213. Sequence in context: A241757 A272883 A257283 * A306278 A199397 A012019 Adjacent sequences: A091208 A091209 A091210 * A091212 A091213 A091214 KEYWORD nonn AUTHOR Antti Karttunen, Jan 03 2004 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.

Last modified December 2 01:41 EST 2023. Contains 367505 sequences. (Running on oeis4.)