A057578 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A057578

Maximal numbers of codewords in ternary code of length n with Hamming distance 3.

%I #22 Feb 08 2022 03:35:48

%S 1,1,1,3,9,18,38

%N Maximal numbers of codewords in ternary code of length n with Hamming distance 3.

%H Patric R. J. Östergård, <a href="https://users.aalto.fi/~pat/23.html">Classification of small binary/ternary one-error-correcting codes (Appendix)</a>, Discrete Mathematics 223 (2000), 253-262.

%Y Cf. A057574-A057584, A050142.

%K nonn,more

%O 0,4

%A _N. J. A. Sloane_, Oct 04 2000