Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128903
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128903 Number of degree n polynomials over GF(2) (with non-zero constant term) at Hamming distance 3 from some irreducible polynomial. +0
1
0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 4, 16, 48, 83, 168, 334, 805, 1475, 3426, 6864, 14146, 29372, 62266, 125674, 125674, 261896, 532460, 1078877, 2208745, 4491454, 9098537, 18615362 (list; graph; listen)
OFFSET

1,11

LINKS

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

CROSSREFS

Adjacent sequences: A128900 A128901 A128902 this_sequence A128904 A128905 A128906

Sequence in context: A101061 A112638 A077162 this_sequence A103435 A119000 A034917

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 October 6 12:54 EDT 2008. Contains 144667 sequences.


AT&T Labs Research