Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030509
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030509 Graham-Sloane-type lower bound on the size of a ternary (n,3,9) constant-weight code. +0
1
27, 244, 1225, 4506, 13559, 35346, 82664, 177494, 355621, 672796, 1212758, 2097452, 3499818, 5659535, 8902155, 13662083, 20509867, 30184333, 43630080, 62040927, 86909874, 120086243, 163840610, 220938240, 294721720 (list; graph; listen)
OFFSET

9,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: A027500 A069979 A075548 this_sequence A042414 A099226 A016107

Adjacent sequences: A030506 A030507 A030508 this_sequence A030510 A030511 A030512

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 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research