Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030507
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030507 Graham-Sloane-type lower bound on the size of a ternary (n,3,7) constant-weight code. +0
1
9, 61, 243, 732, 1837, 4056, 8136, 15149, 26571, 44374, 71125, 110094, 165376, 242014, 346136, 485103, 667662, 904109, 1206463, 1588650, 2066688, 2658897, 3386099, 4271843, 5342629, 6628148, 8161525, 9979578, 12123079, 14637028 (list; graph; listen)
OFFSET

7,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: A086018 A138589 A058777 this_sequence A005060 A125346 A016200

Adjacent sequences: A030504 A030505 A030506 this_sequence A030508 A030509 A030510

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research