Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128901
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128901 Number of degree n polynomials over GF(2) (with non-zero constant term) at Hamming distance 1 from some irreducible polynomial. +0
1
0, 1, 2, 4, 8, 16, 32, 63, 128, 255, 510, 1020, 2032, 4048, 8109, 16216, 32434, 64731, 129597, 258718, 517424, 1034430, 2067780, 4132038, 8262934, 16515320, 33021972, 66029987, 132008983, 263944002, 527772375, 1055126462 (list; graph; listen)
OFFSET

1,3

LINKS

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

EXAMPLE

The coefficient vectors of the two degree 3 irreducible polynomials are 1011 and 1101. They are at distance one from the two polynomials 1001 and 1111; thus a(3) = |{1001,1111}| = 2.

CROSSREFS

Sequence in context: A001592 A140134 A049886 this_sequence A025489 A036140 A036138

Adjacent sequences: A128898 A128899 A128900 this_sequence A128902 A128903 A128904

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research