id:A091248 - OEIS Search Results

Search: id:A091248

Displaying 1-1 of 1 results found.

page 1

Number of irreducible factors in the factorization of GF(2)[X]-polynomial x^n+1 (counted with multiplicity).

+0
2

1, 2, 2, 4, 2, 4, 3, 8, 3, 4, 2, 8, 2, 6, 5, 16, 3, 6, 2, 8, 6, 4, 3, 16, 3, 4, 4, 12, 2, 10, 7, 32, 5, 6, 6, 12, 2, 4, 5, 16, 3, 12, 4, 8, 8, 6, 3, 32, 5, 6, 8, 8, 2, 8, 5, 24, 5, 4, 2, 20, 2, 14, 13, 64, 7, 10, 2, 12, 6, 12, 3, 24, 9, 4, 8, 8, 6, 10, 3, 32, 5, 6, 2, 24, 12, 8, 5, 16, 9, 16 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`A. Karttunen, Scheme-program for computing this sequence.` `Index entries for sequences operating on GF(2)[X]-polynomials`
	FORMULA	`a(n) = A091222(A000051(n)).`
	CROSSREFS	`Cf. A000374 gives the number of distinct irreducible factors of the same polynomials.` `Sequence in context: A165872 A061142 A152858 this_sequence A082991 A100008 A102763` `Adjacent sequences: A091245 A091246 A091247 this_sequence A091249 A091250 A091251`
	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 December 18 21:37 EST 2009. Contains 171024 sequences.

AT&T Labs Research