login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030504 Graham-Sloane-type lower bound on the size of a ternary (n,3,4) constant-weight code. 0

%I #9 Apr 02 2020 19:38:01

%S 2,8,19,38,66,107,160,230,317,424,553,705,883,1088,1324,1591,1891,

%T 2227,2601,3015,3470,3969,4514,5106,5748,6441,7189,7992,8852,9772,

%U 10754,11800,12911,14090,15339,16659,18053,19522,21070,22697

%N Graham-Sloane-type lower bound on the size of a ternary (n,3,4) constant-weight code.

%H M. Svanstrom, <a href="http://www.dtr.isy.liu.se/dtr/staff/mattias">A lower bound for ternary constant weight codes</a>, IEEE Trans. on Information Theory, Vol. 43, pp. 1630-1632, Sep. 1997.

%F a(n) = ceiling(binomial(n, w) * 2^w / (2*n + 1)) with w=4.

%K nonn

%O 4,1

%A Mattias Svanstrom (mattias(AT)isy.liu.se)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 13 20:16 EDT 2024. Contains 371645 sequences. (Running on oeis4.)