id:A091219 - OEIS Search Results

Search: id:A091219

Displaying 1-1 of 1 results found.

page 1

Moebius-analogue for the domain GF(2)[X]: a(n)=0 if A091221(n)!=A091222(n) (i.e. if the polynomial is not square-free), otherwise (-1)^A091222(n).

+0
4

1, -1, -1, 0, 0, 1, -1, 0, 1, 0, -1, 0, -1, 1, 0, 0, 0, -1, -1, 0, 0, 1, 1, 0, -1, 1, 0, 0, 1, 0, -1, 0, 1, 0, 1, 0, -1, 1, 0, 0, -1, 0, 1, 0, 0, -1, -1, 0, 1, 1, 0, 0, 1, 0, -1, 0, 0, -1, -1, 0, -1, 1, 0, 0, 0, -1, -1, 0, 0, -1, 1, 0, -1, 1, 0, 0, 1, 0, 1, 0, 0, 1, -1, 0, 0, -1, -1, 0, 1, 0 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`The absolute values give a characteristic function for square-free GF(2)[X]-polynomials.`
	LINKS	`A. Karttunen, Scheme-program for computing this sequence.` `Index entries for sequences operating on GF(2)[X]-polynomials`
	CROSSREFS	`a(n) = A008683(A091203(n)) = A008683(A091205(n)).` `Sequence in context: A110037 A128810 A123272 this_sequence A016416 A014024 A014039` `Adjacent sequences: A091216 A091217 A091218 this_sequence A091220 A091221 A091222`
	KEYWORD	`sign`
	AUTHOR	`Antti Karttunen (His-Firstname.His-Surname(AT)iki.fi), Jan 03 2004`

page 1

Search completed in 0.002 seconds

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.

AT&T Labs Research