|
|
A226522
|
|
Irregular triangle read by rows: T(n,k) = maximal number of minimal codewords over the set of all [n,k] cycle codes, for n >= 3.
|
|
0
|
|
|
1, 1, 1, 3, 1, 3, 7, 1, 3, 7, 1, 3, 7, 13, 1, 3, 7, 15, 22, 1, 3, 7, 15, 24, 37, 1, 3, 7, 15, 26, 39, 1, 3, 7, 15, 29, 42, 63, 1, 3, 7, 15, 29, 46, 69, 91, 1, 3, 7, 15, 29, 51, 75, 108, 133, 1, 3, 7, 15, 29, 57, 82, 123, 156, 197
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,4
|
|
COMMENTS
|
"Cycle code" refers to the linear code generated by the cycles of a connected graph.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1
1
1 3
1 3 7
1 3 7
1 3 7 13
1 3 7 15 22
1 3 7 15 24 37
1 3 7 15 26 39
1 3 7 15 29 42 63
1 3 7 15 29 46 69 91
1 3 7 15 29 51 75 108 133
1 3 7 15 29 57 82 123 156 197
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|