This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091227 Inverse function of A014580: position in A014580 if the n-th GF(2)[X] polynomial is irreducible, 0 otherwise. 11
 0, 1, 2, 0, 0, 0, 3, 0, 0, 0, 4, 0, 5, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 9, 0, 0, 0, 10, 0, 0, 0, 0, 0, 11, 0, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 13, 0, 14, 0, 0, 0, 0, 0, 15, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 0, 0, 0, 18, 0, 0, 0, 0, 0, 19, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS A. Karttunen, Scheme-program for computing this sequence. FORMULA a(n) = A091225(n) * A091226(n). CROSSREFS Inverse of A014580. a(n) = A049084(A091203(n)). Sequence in context: A226728 A140579 A244140 * A300715 A035444 A244141 Adjacent sequences:  A091224 A091225 A091226 * A091228 A091229 A091230 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 20 03:32 EST 2019. Contains 319323 sequences. (Running on oeis4.)