A091229 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A091229

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

1

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

Analogous to A007920.

LINKS

Table of n, a(n) for n=0..99.

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

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

FORMULA

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

CROSSREFS

Cf. A007920, A091228.

Sequence in context: A037872 A037854 A362633 * A290255 A283982 A370883

Adjacent sequences: A091226 A091227 A091228 * A091230 A091231 A091232

KEYWORD

nonn

AUTHOR

Antti Karttunen, Jan 03 2004

STATUS

approved