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. 13
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS A. Karttunen, Scheme-program for computing this sequence. CROSSREFS a(n) = A001221(A091203(n)) = A001221(A091205(n)). A000374(n) = a(A000051(n)). Sequence in context: A177025 A265210 A023396 * A106495 A100428 A206719 Adjacent sequences:  A091218 A091219 A091220 * A091222 A091223 A091224 KEYWORD nonn AUTHOR Antti Karttunen, Jan 03 2004 STATUS approved

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

Last modified August 17 15:28 EDT 2018. Contains 313816 sequences. (Running on oeis4.)