A091228 Smallest m >= n, such that m is irreducible when interpreted as GF(2)[X]-polynomial.

2, 2, 2, 3, 7, 7, 7, 7, 11, 11, 11, 11, 13, 13, 19, 19, 19, 19, 19, 19, 25, 25, 25, 25, 25, 25, 31, 31, 31, 31, 31, 31, 37, 37, 37, 37, 37, 37, 41, 41, 41, 41, 47, 47, 47, 47, 47, 47, 55, 55, 55, 55, 55, 55, 55, 55, 59, 59, 59, 59, 61, 61, 67, 67, 67, 67, 67, 67, 73, 73, 73

Offset: 0

Author

Antti Karttunen, Jan 03 2004

Keywords

• nonn

Comments

Analogous to A007918.

Links

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

Formula

a(n) = n + A091229(n).