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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030511 Graham-Sloane-type lower bound on the size of a ternary (n,3,3) constant-weight code. 2
2, 6, 10, 16, 24, 32, 42, 54, 66, 80, 96, 112, 130, 150, 170, 192, 216, 240, 266, 294, 322, 352, 384, 416, 450, 486, 522, 560, 600, 640, 682, 726, 770, 816, 864, 912, 962, 1014, 1066, 1120, 1176, 1232, 1290, 1350, 1410, 1472, 1536, 1600 (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.

Index to sequences with linear recurrences with constant coefficients, signature (2,-1,1,-2,1).

FORMULA

a(n) = 2 * (n - 1)^2 / 3, if n=1 (mod 3), a(n) = 2 * n * (n - 2) / 3, otherwise

G.f. -2*x^3*(1+x) / ( (1+x+x^2)*(x-1)^3 ). - R. J. Mathar, Aug 25 2011

a(n) = 2*A000212(n-1). - R. J. Mathar, Aug 25 2011

CROSSREFS

Sequence in context: A195957 A183575 A096184 * A071597 A100899 A099540

Adjacent sequences:  A030508 A030509 A030510 * A030512 A030513 A030514

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 17 16:49 EST 2012. Contains 206058 sequences.