|
Search: id:A135304
|
|
|
| A135304 |
|
Maximal size of conflict-avoiding code of length 2n+1. |
|
+0
1
|
|
| 1, 1, 1, 2, 2, 3, 4, 4, 4, 5, 5, 6, 6, 7
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
The next two terms are probably 6 and 7. The sequence then continues 8, 9, 10, 10, 9?, 11, 11, 11?, 13, ...
|
|
REFERENCES
|
V. I. Levenshtein, Conflict-avoiding codes and cyclic triple systems [in Russian], Problemy Peredachi Informatsii, 43 (No. 3, 2007), 39-53.
|
|
CROSSREFS
|
Sequence in context: A060018 A089576 A076642 this_sequence A112325 A029111 A092038
Adjacent sequences: A135301 A135302 A135303 this_sequence A135305 A135306 A135307
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 05 2007
|
|
|
Search completed in 0.002 seconds
|
