%I A010336
%S A010336 1,1,1,1,2,2,2,2,2,4,4,4,6,8,12,16,26
%N A010336 Maximal size of binary code of length n and asymmetric distance 5.
%D A010336 T. Etzion, New lower bounds for asymmetric and unidirectional codes, 
               IEEE Trans. Inform. Theory, 37 (1991), 1696-1705.
%D A010336 J. H. Weber, Bounds and Constructions for Binary Block Codes Correcting 
               Asymmetric or Unidirectional Errors, Ph. D. Thesis, Tech. Univ. Delft, 
               1989.
%D A010336 J. H. Weber, C. de Vroedt and D. E. Boekee, Bounds and constructions 
               for binary codes of length less than 24 and asymmetric distance less 
               than 6, IEEE Trans. Inform. Theory, 34 (1988), 1321-1332.
%Y A010336 Cf. A010101, A010238, A054536.
%Y A010336 Sequence in context: A001306 A108105 A063468 this_sequence A054537 A029104 
               A085543
%Y A010336 Adjacent sequences: A010333 A010334 A010335 this_sequence A010337 A010338 
               A010339
%K A010336 nonn,nice,hard
%O A010336 1,5
%A A010336 N. J. A. Sloane (njas(AT)research.att.com), Apr 10 2000