Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030510
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030510 Graham-Sloane-type lower bound on the size of a ternary (n,3,10) constant-weight code. +0
1
49, 490, 2704, 10847, 35346, 99196, 248491, 568993, 1211033, 2425515, 4614394, 8399563, 14714789, 24926034, 40986248, 65631574, 102626730, 157068288, 235755520, 347639496, 504362220, 720898682, 1016315904 (list; graph; listen)
OFFSET

10,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: A063132 A012097 A061621 this_sequence A104935 A110203 A166832

Adjacent sequences: A030507 A030508 A030509 this_sequence A030511 A030512 A030513

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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research