login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030503 Graham-Sloane-type lower bound on the size of a ternary (n,3,3) constant-weight code. 0
2, 4, 8, 13, 19, 27, 36, 46, 58, 71, 85, 101, 118, 136, 156, 177, 199, 223, 248, 274, 302, 331, 361, 393, 426, 460, 496, 533, 571, 611, 652, 694, 738, 783, 829, 877, 926, 976, 1028, 1081, 1135, 1191, 1248, 1306, 1366, 1427, 1489, 1553, 1618 (list; graph; refs; listen; history; internal format)
OFFSET

3,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) = ceil (binomial (n, w) * 2^w / (2*n + 1))

CROSSREFS

Sequence in context: A058329 A037380 A186752 * A084684 A011907 A056133

Adjacent sequences:  A030500 A030501 A030502 * A030504 A030505 A030506

KEYWORD

nonn

AUTHOR

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 | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 07:42 EST 2012. Contains 205717 sequences.