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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091227 Inverse function of A014580: position in A014580 if the n-th GF(2)[X] polynomial is irreducible, 0 otherwise. 11

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

%S 0,1,2,0,0,0,3,0,0,0,4,0,5,0,0,0,0,0,6,0,0,0,0,0,7,0,0,0,0,0,8,0,0,0,

%T 0,0,9,0,0,0,10,0,0,0,0,0,11,0,0,0,0,0,0,0,12,0,0,0,13,0,14,0,0,0,0,0,

%U 15,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,17,0,0,0,18,0,0,0,0,0,19,0

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

%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) = A091225(n) * A091226(n).

%Y Inverse of A014580. a(n) = A049084(A091203(n)).

%K nonn

%O 1,3

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 26 06:23 EDT 2024. Contains 371990 sequences. (Running on oeis4.)