Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091254
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091254 Reducible polynomials over GF(2) in binary format. +0
2
100, 101, 110, 1000, 1001, 1010, 1100, 1110, 1111, 10000, 10001, 10010, 10100, 10101, 10110, 10111, 11000, 11010, 11011, 11100, 11101, 11110, 100000, 100001, 100010, 100011, 100100, 100110, 100111, 101000, 101010, 101011, 101100 (list; graph; listen)
OFFSET

1,1

LINKS

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

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

CROSSREFS

a(n) = A007088(A091242(n)). Cf. A058943.

Sequence in context: A070794 A090429 A079112 this_sequence A085251 A063010 A094027

Adjacent sequences: A091251 A091252 A091253 this_sequence A091255 A091256 A091257

KEYWORD

nonn

AUTHOR

Antti Karttunen (His-Firstname.His-Surname(AT)iki.fi), Jan 03 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research