Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030508
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030508 Graham-Sloane-type lower bound on the size of a ternary (n,3,8) constant-weight code. +0
1
16, 122, 549, 1837, 5069, 12203, 26510, 53141, 99840, 177811, 302759, 496128, 786545, 1211476, 1819136, 2670647, 3842461, 5429083, 7546084, 10333440, 13959209, 18623545, 24563096, 32055772, 41425920, 53049910, 67362149 (list; graph; listen)
OFFSET

8,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: A104265 A068880 A053883 this_sequence A006215 A060633 A125353

Adjacent sequences: A030505 A030506 A030507 this_sequence A030509 A030510 A030511

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research