Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030503
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030503 Graham-Sloane-type lower bound on the size of a ternary (n,3,3) constant-weight code. +0
1
2, 4, 8, 13, 19, 27, 36, 46, 58, 71, 85, 101, 118, 136, 156, 177, 199, 223, 248, 274, 302, 331, 361, 393, 426, 460, 496, 533, 571, 611, 652, 694, 738, 783, 829, 877, 926, 976, 1028, 1081, 1135, 1191, 1248, 1306, 1366, 1427, 1489, 1553, 1618 (list; graph; listen)
OFFSET

3,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: A030058 A058329 A037380 this_sequence A084684 A011907 A056133

Adjacent sequences: A030500 A030501 A030502 this_sequence A030504 A030505 A030506

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 December 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research