This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091221 Number of distinct irreducible polynomials dividing n-th GF(2)[X]-polynomial. 6

%I

%S 0,1,1,1,1,2,1,1,2,2,1,2,1,2,1,1,1,3,1,2,1,2,2,2,1,2,2,2,2,2,1,1,2,2,

%T 2,3,1,2,2,2,1,2,2,2,2,3,1,2,2,2,1,2,2,3,1,2,2,3,1,2,1,2,2,1,2,3,1,2,

%U 1,3,2,3,1,2,2,2,2,3,2,2,1,2,3,2,1,3,1,2,2,3,1,3,2,2,2,2,1,3,2,2,3,2

%N Number of distinct irreducible polynomials dividing n-th GF(2)[X]-polynomial.

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

%Y a(n) = A001221(A091203(n)) = A001221(A091205(n)). A000374(n) = a(A000051(n)).

%K nonn

%O 1,6

%A _Antti Karttunen_, Jan 03 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .