login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091219 Moebius-analogue for the domain GF(2)[X]: a(n)=0 if A091221(n)!=A091222(n) (i.e. if the polynomial is not squarefree), otherwise (-1)^A091222(n). 3
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; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

The absolute values give a characteristic function for squarefree 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: A145379 A128810 A123272 * A016416 A014024 A014039

Adjacent sequences:  A091216 A091217 A091218 * A091220 A091221 A091222

KEYWORD

sign

AUTHOR

Antti Karttunen (His-Firstname.His-Surname(AT)iki.fi), 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 .

Last modified February 13 08:12 EST 2012. Contains 205451 sequences.