A135304 Maximal size of conflict-avoiding code of length 2n+1.

1, 1, 1, 2, 2, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 10, 10, 10, 11, 11, 11, 13, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 17, 19, 18, 19, 19, 20, 21, 22, 21, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 28, 28, 28, 29, 29, 29, 31, 31, 30, 31, 32, 32, 33, 34, 34, 35, 35, 36, 36, 37, 36, 38, 38, 39, 40

Offset

1,4

Comments

This sequence is not monotonically increasing. - Kenneth Shum, Jul 08 2014

Links

Kenneth Shum, Table of n, a(n) for n = 1..259

Hung-Lin Fu, Yuan-Hsun Lo and Kenneth W. Shum, Optimal conflict-avoiding codes of odd length and weight three, Design Codes Cryptography, 72, (2014), 289-309.

V. I. Levenshtein, Conflict-avoiding codes and cyclic triple systems [in Russian], Problemy Peredachi Informatsii, 43 (No. 3, 2007), 39-53.

V. I. Levenshtein, Conflict-avoiding codes and cyclic triple systems, Problems of Information Transmission, September 2007, Volume 43, Issue 3, pp 199-212.

K. W. Shum, On Conflict-Avoiding Codes of Weight Three and Odd Length, Signal Design and its Applications in Communications (IWSDA), 2011 Fifth International Workshop.

Crossrefs

Sequence in context: A089576 A076642 A112325 * A249037 A029111 A228944

Adjacent sequences: A135301 A135302 A135303 * A135305 A135306 A135307

Keyword

nonn

Author

N. J. A. Sloane, Dec 05 2007

Extensions

Terms corrected and more terms added, Kenneth Shum, Jul 08 2014

Status

approved