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

%I #6 Mar 31 2012 14:02:20

%S 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,

%T 25,31,31,31,31,31,31,37,37,37,37,37,37,41,41,41,41,47,47,47,47,47,47,

%U 55,55,55,55,55,55,55,55,59,59,59,59,61,61,67,67,67,67,67,67,73,73,73

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

%C Analogous to A007918.

%H A. Karttunen, <a href="/A091247/a091247.scm.txt">Scheme-program for computing this sequence.</a>

%H <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a>

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

%K nonn

%O 0,1

%A _Antti Karttunen_, Jan 03 2004