Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030506
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030506 Graham-Sloane-type lower bound on the size of a ternary (n,3,6) constant-weight code. +0
1
5, 30, 106, 283, 640, 1286, 2366, 4068, 6628, 10333, 15531, 22631, 32111, 44525, 60504, 80766, 106117, 137460, 175799, 222244, 278014, 344448, 423007, 515276, 622978, 747968, 892251, 1057976, 1247448, 1463131, 1707654 (list; graph; listen)
OFFSET

6,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: A164015 A128302 A071252 this_sequence A062990 A018213 A047661

Adjacent sequences: A030503 A030504 A030505 this_sequence A030507 A030508 A030509

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 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research