%I M0240 #39 Feb 16 2025 08:32:29

%S 1,1,1,1,1,2,2,2,4,6,12,24,32,64,128,256

%N The coding-theoretic function A(n,6).

%C Since A(n,5) = A(n+1,6), A(n,5) gives essentially the same sequence.

%C The next term is known only to be in the range 258-340. - _Moshe Milshtein_, Apr 24 2019

%D J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 248.

%D F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 674.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H A. E. Brouwer, <a href="http://www.win.tue.nl/~aeb/codes/binary-1.html">Tables of general binary codes</a>

%H A. E. Brouwer, J. B. Shearer, N. J. A. Sloane and W. D. Smith, <a href="http://dx.doi.org/10.1109/18.59932">New table of constant weight codes</a>, IEEE Trans. Info. Theory 36 (1990), 1334-1380.

%H M. Grassl, <a href="http://www.codetables.de/">Bounds on the minimum distance of linear codes</a>

%H Moshe Milshtein, <a href="https://doi.org/10.1007/s12095-019-00365-7">A new two-error-correcting binary code of length 16</a>, Cryptography and Communications (2019).

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Error-CorrectingCode.html">Error-Correcting Code.</a>

%H <a href="/index/Aa#And">Index entries for sequences related to A(n,d)</a>

%Y Cf. A005864, A005866, A169761, A169762.

%K nonn,hard,nice

%O 1,6

%A _N. J. A. Sloane_