Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030505
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030505 Graham-Sloane-type lower bound on the size of a ternary (n,3,5) constant-weight code. +0
1
3, 15, 45, 106, 213, 384, 643, 1014, 1526, 2210, 3100, 4236, 5658, 7411, 9541, 12101, 15144, 18727, 22910, 27758, 33337, 39717, 46971, 55175, 64410, 74758, 86304, 99139, 113355, 129047, 146314, 165257, 185983, 208600, 233219 (list; graph; listen)
OFFSET

5,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: A094191 A050534 A048099 this_sequence A074355 A005560 A100747

Adjacent sequences: A030502 A030503 A030504 this_sequence A030506 A030507 A030508

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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research