login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of degree n polynomials over GF(2) (with nonzero constant term) at Hamming distance 3 from some irreducible polynomial.
0

%I #4 Aug 10 2015 00:03:51

%S 0,0,0,0,0,0,0,1,0,1,2,4,16,48,83,168,334,805,1475,3426,6864,14146,

%T 29372,62266,125674,125674,261896,532460,1078877,2208745,4491454,

%U 9098537,18615362

%N Number of degree n polynomials over GF(2) (with nonzero constant term) at Hamming distance 3 from some irreducible polynomial.

%H G. Lee, F. Ruskey and A. Williams, <a href="http://www.cs.uvic.ca/~ruskey/Publications/DistGF2/DistGF2.html">Hamming distance from irreducible polynomials over GF(2)</a>

%K nonn

%O 1,11

%A _Frank Ruskey_, Apr 22 2007