A091227 Inverse function of A014580: position in A014580 if the n-th GF(2)[X] polynomial is irreducible, 0 otherwise.

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

Offset

1,3

Links

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

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

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

Formula

a(n) = A091225(n) * A091226(n).

Crossrefs

Inverse of A014580. a(n) = A049084(A091203(n)).

Sequence in context: A325458 A226728 A244140 * A300715 A035444 A244141

Adjacent sequences: A091224 A091225 A091226 * A091228 A091229 A091230

Keyword

nonn

Author

Antti Karttunen, Jan 03 2004

Status

approved