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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091243 Differences between consecutive reducible GF(2)[X]-polynomials. 2
1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

Analogous to A073783.

LINKS

A. Karttunen, Scheme-program for computing this sequence.

Index entries for sequences operating on GF(2)[X]-polynomials

CROSSREFS

First differences of A091242. a(n) = A091244(n)+1.

Sequence in context: A140885 A064286 A002471 * A037826 A079882 A014709

Adjacent sequences:  A091240 A091241 A091242 * A091244 A091245 A091246

KEYWORD

nonn

AUTHOR

Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), 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 17 00:09 EST 2012. Contains 205978 sequences.