|
Search: id:A091006
|
|
|
| A091006 |
|
Triangle T(n,k) read by rows giving number of inequivalent indecomposable binary linear [n,k] codes with all columns distinct (projective codes) (n >= 1, 1 <= k <= n). |
|
+0
1
|
|
| 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 1, 4, 3, 1, 0, 0, 0, 0, 5, 9, 4, 1, 0, 0, 0, 0, 5, 22, 19, 6, 1, 0, 0, 0, 0, 4, 40, 70, 35, 7, 1, 0, 0, 0, 0, 3, 60, 220, 190, 59, 9, 1, 0, 0, 0, 0, 2, 86, 629, 977, 466, 96, 11, 1, 0, 0, 0, 0, 1, 110, 1700
(list; table; graph; listen)
|
|
|
OFFSET
|
1,19
|
|
|
LINKS
|
H. Fripertinger, Isometry Classes of Codes
Index entries for sequences related to binary linear codes
|
|
EXAMPLE
|
1; 0,0; 0,1,0; 0,0,1,0; 0,0,1,1,0; 0,0,1,2,1,0; ...
|
|
CROSSREFS
|
Sequence in context: A047998 A017847 A127841 this_sequence A167365 A025894 A051127
Adjacent sequences: A091003 A091004 A091005 this_sequence A091007 A091008 A091009
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 01 2004
|
|
|
Search completed in 0.002 seconds
|
