login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091246 Inverse function of A091242: position in A091242 if the n-th GF(2)[X] polynomial is reducible, 0 otherwise. 5
0, 0, 0, 1, 2, 3, 0, 4, 5, 6, 0, 7, 0, 8, 9, 10, 11, 12, 0, 13, 14, 15, 16, 17, 0, 18, 19, 20, 21, 22, 0, 23, 24, 25, 26, 27, 0, 28, 29, 30, 0, 31, 32, 33, 34, 35, 0, 36, 37, 38, 39, 40, 41, 42, 0, 43, 44, 45, 0, 46, 0, 47, 48, 49, 50, 51, 0, 52, 53, 54, 55, 56, 0, 57, 58, 59 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Analogous to A066246.

LINKS

Table of n, a(n) for n=1..76.

A. Karttunen, Scheme-program for computing this sequence.

Index entries for sequences operating on GF(2)[X]-polynomials

FORMULA

a(n) = A091245(n) * A091247(n).

CROSSREFS

Inverse of A091242.

Sequence in context: A100112 A198787 A193331 * A271439 A133637 A258093

Adjacent sequences:  A091243 A091244 A091245 * A091247 A091248 A091249

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 11 08:50 EDT 2020. Contains 335626 sequences. (Running on oeis4.)