Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030504
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030504 Graham-Sloane-type lower bound on the size of a ternary (n,3,4) constant-weight code. +0
1
2, 8, 19, 38, 66, 107, 160, 230, 317, 424, 553, 705, 883, 1088, 1324, 1591, 1891, 2227, 2601, 3015, 3470, 3969, 4514, 5106, 5748, 6441, 7189, 7992, 8852, 9772, 10754, 11800, 12911, 14090, 15339, 16659, 18053, 19522, 21070, 22697 (list; graph; listen)
OFFSET

4,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: A049525 A109071 A031327 this_sequence A000158 A101427 A126877

Adjacent sequences: A030501 A030502 A030503 this_sequence A030505 A030506 A030507

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research