|
| |
|
|
A005865
|
|
The coding-theoretic function A(n,6).
(Formerly M0240)
|
|
3
| |
|
|
1, 1, 1, 1, 1, 2, 2, 2, 4, 6, 12, 24, 32, 64, 128, 256
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,6
|
|
|
COMMENTS
| Since A(n,5) = A(n+1,6), A(n,5) gives essentially the same sequence.
|
|
|
REFERENCES
| A. E. Brouwer, J. B. Shearer, N. J. A. Sloane and W. D. Smith, New table of constant weight codes, IEEE Trans. Info. Theory 36 (1990), 1334-1380.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| M. Grassl, Bounds on the minimum distance of linear codes
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Index entries for sequences related to A(n,d)
|
|
|
CROSSREFS
| Cf. A005864, A005866, A169761, A169762.
Sequence in context: A064355 A000799 A063823 * A176051 A153988 A098705
Adjacent sequences: A005862 A005863 A005864 * A005866 A005867 A005868
|
|
|
KEYWORD
| nonn,hard,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| The next term is only known to be in the range 256-340.
|
| |
|
|