A091226 Number of irreducible GF(2)[X]-polynomials in range [0,n].

0, 0, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16

Offset: 0

Author

Antti Karttunen, Jan 03 2004

Keywords

• nonn

Comments

Analogous to A000720.

Links

• A. Karttunen, Scheme-program for computing this sequence.
• Index entries for sequences operating on GF(2)[X]-polynomials

Crossrefs

Partial sums of A091225. A062692(n) = a(2^n).