|
|
A091848
|
|
Johnson bound J(n,4,2).
|
|
2
|
|
|
0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 18, 21, 22, 25, 26, 29, 30, 33, 35, 38, 40, 44, 45, 49, 51, 55, 57, 61, 63, 68, 70, 75, 77, 82, 84, 90, 92, 98, 100, 106, 108, 114, 117, 123, 126, 133, 135, 142, 145, 152, 155, 162, 165
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,9
|
|
COMMENTS
|
|
|
REFERENCES
|
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 527, Cor. 5.
|
|
LINKS
|
Index entries for linear recurrences with constant coefficients, signature (1,1,-1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,-1, -1,1).
|
|
FORMULA
|
|
|
MATHEMATICA
|
LinearRecurrence[{1, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, -1, 1}, {0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 18, 21, 22, 25, 26}, 80] (* Harvey P. Dale, Nov 29 2017 *)
|
|
PROG
|
(PARI) Johnson(n, w, l)=my(pr=1); forstep(k=l, 1, -1, pr=pr*(n-k)\(w-k)); pr\w
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|