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”).

A030510
Graham-Sloane-type lower bound on the size of a ternary (n,3,10) constant-weight code.
0
49, 490, 2704, 10847, 35346, 99196, 248491, 568993, 1211033, 2425515, 4614394, 8399563, 14714789, 24926034, 40986248, 65631574, 102626730, 157068288, 235755520, 347639496, 504362220, 720898682, 1016315904
OFFSET
10,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=10.
CROSSREFS
Sequence in context: A263707 A061621 A337356 * A104935 A110203 A263704
KEYWORD
nonn
AUTHOR
Mattias Svanstrom (mattias(AT)isy.liu.se)
STATUS
approved