|
Search: id:A001295
|
|
|
| A001295 |
|
Triangle in which k-th number (0<=k<=n) in n-th row (0<=n) is number of hexads in S(5,6,12) containing k given points and missing n-k given points. |
|
+0
1
|
|
| 132, 66, 66, 30, 36, 30, 12, 18, 18, 12, 4, 8, 10, 8, 4, 1, 3, 5, 5, 3, 1, 1, 0, 3, 2, 3, 0, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 68.
Handbook of Combinatorics, North-Holland '95, p. 720.
|
|
CROSSREFS
|
Sequence in context: A091743 A066621 A033530 this_sequence A105684 A108601 A039603
Adjacent sequences: A001292 A001293 A001294 this_sequence A001296 A001297 A001298
|
|
KEYWORD
|
nonn,tabl,fini,full
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
