A091229 Smallest k such that n+k is irreducible when interpreted as GF(2)[X]-polynomial.

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

Offset: 0

Author

Antti Karttunen, Jan 03 2004

Keywords

• nonn

Comments

Analogous to A007920.

Links

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

Crossrefs

Cf. A007920, A091228.

Formula

a(n) = A091228(n) - n.