Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128902
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128902 Number of degree n polynomials over GF(2) (with non-zero constant term) at Hamming distance 2 from some irreducible polynomial. +0
1
0, 0, 0, 1, 2, 7, 14, 34, 72, 157, 326, 689, 1418, 2935, 6010, 12304, 25058, 51004, 103478, 209767, 424430, 858019, 1732430, 3495434, 7046432, 14196421, 28583424, 57522469, 115704938, 232645189, 467597246, 939526144 (list; graph; listen)
OFFSET

1,5

LINKS

G. Lee, F. Ruskey and A. Williams, Hamming distance from irreducible polynomials over GF(2)

EXAMPLE

The coefficient vectors of the three degree 4 irreducible polynomials are 10011, 11111 and 11001. There is only one polynomial whose Hamming distance is two (or more) from all of them, namely 10101. Thus a(4) = |{10101}| = 1.

CROSSREFS

Adjacent sequences: A128899 A128900 A128901 this_sequence A128903 A128904 A128905

Sequence in context: A140253 A018453 A000147 this_sequence A060552 A018497 A107373

KEYWORD

nonn

AUTHOR

Frank Ruskey (ruskey(AT)cs.uvic.ca), Apr 22 2007

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 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research