Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030511
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030511 Graham-Sloane-type lower bound on the size of a ternary (n,3,3) constant-weight code. +0
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; listen)
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) = 2 * (n - 1)^2 / 3, if n=1 (mod 3), a(n) = 2 * n * (n - 2) / 3, otherwise

CROSSREFS

Sequence in context: A124198 A032426 A096184 this_sequence A071597 A100899 A099540

Adjacent sequences: A030508 A030509 A030510 this_sequence A030512 A030513 A030514

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research