id:A091222 - OEIS Search Results

Search: id:A091222

Displaying 1-1 of 1 results found.

page 1

Number of irreducible polynomials dividing n-th GF(2)[X]-polynomial, counted with multiplicity.

+0
7

0, 1, 1, 2, 2, 2, 1, 3, 2, 3, 1, 3, 1, 2, 3, 4, 4, 3, 1, 4, 2, 2, 2, 4, 1, 2, 3, 3, 2, 4, 1, 5, 2, 5, 2, 4, 1, 2, 3, 5, 1, 3, 2, 3, 4, 3, 1, 5, 2, 2, 5, 3, 2, 4, 1, 4, 3, 3, 1, 5, 1, 2, 3, 6, 4, 3, 1, 6, 2, 3, 2, 5, 1, 2, 4, 3, 2, 4, 2, 6, 2, 2, 3, 4, 6, 3, 1, 4, 2, 5, 1, 4, 2, 2, 3, 6, 1, 3, 3, 3, 3, 6 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`A. Karttunen, Scheme-program for computing this sequence.` `Index entries for sequences operating on GF(2)[X]-polynomials`
	CROSSREFS	`a(n) = A001222(A091203(n)) = A001222(A091205(n)). A091248(n) = a(A000051(n)).` `Adjacent sequences: A091219 A091220 A091221 this_sequence A091223 A091224 A091225` `Sequence in context: A078687 A133138 A037180 this_sequence A064659 A127953 A130267`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (His-Firstname.His-Surname(AT)iki.fi), Jan 03 2004`

page 1

Search completed in 0.002 seconds

Last modified November 9 12:23 EST 2009. Contains 166233 sequences.

AT&T Labs Research