login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A030506
Graham-Sloane-type lower bound on the size of a ternary (n,3,6) constant-weight code.
0
5, 30, 106, 283, 640, 1286, 2366, 4068, 6628, 10333, 15531, 22631, 32111, 44525, 60504, 80766, 106117, 137460, 175799, 222244, 278014, 344448, 423007, 515276, 622978, 747968, 892251, 1057976, 1247448, 1463131, 1707654
OFFSET
6,1
LINKS
M. Svanstrom, A lower bound for ternary constant weight codes, IEEE Trans. on Information Theory, Vol. 43, pp. 1630-1632, Sep. 1997.
FORMULA
a(n) = ceiling(binomial(n, w) * 2^w / (2*n + 1)) with w=6.
CROSSREFS
Sequence in context: A288679 A071252 A174002 * A062990 A018213 A359975
KEYWORD
nonn
AUTHOR
Mattias Svanstrom (mattias(AT)isy.liu.se)
STATUS
approved