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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030509 Graham-Sloane-type lower bound on the size of a ternary (n,3,9) constant-weight code. 0
27, 244, 1225, 4506, 13559, 35346, 82664, 177494, 355621, 672796, 1212758, 2097452, 3499818, 5659535, 8902155, 13662083, 20509867, 30184333, 43630080, 62040927, 86909874, 120086243, 163840610, 220938240, 294721720 (list; graph; refs; listen; history; text; internal format)
OFFSET

9,1

LINKS

Table of n, a(n) for n=9..33.

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: A183806 A207104 A075548 * A042414 A099226 A016107

Adjacent sequences:  A030506 A030507 A030508 * A030510 A030511 A030512

KEYWORD

nonn

AUTHOR

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

STATUS

approved

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 May 26 02:03 EDT 2013. Contains 225652 sequences.