The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091246 Inverse function of A091242: position in A091242 if the n-th GF(2)[X] polynomial is reducible, 0 otherwise. 5

%I

%S 0,0,0,1,2,3,0,4,5,6,0,7,0,8,9,10,11,12,0,13,14,15,16,17,0,18,19,20,

%T 21,22,0,23,24,25,26,27,0,28,29,30,0,31,32,33,34,35,0,36,37,38,39,40,

%U 41,42,0,43,44,45,0,46,0,47,48,49,50,51,0,52,53,54,55,56,0,57,58,59

%N Inverse function of A091242: position in A091242 if the n-th GF(2)[X] polynomial is reducible, 0 otherwise.

%C Analogous to A066246.

%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) = A091245(n) * A091247(n).

%Y Inverse of A091242.

%K nonn

%O 1,5

%A _Antti Karttunen_, Jan 03 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 4 16:34 EDT 2020. Contains 336202 sequences. (Running on oeis4.)