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
%I A030508
%S A030508 16,122,549,1837,5069,12203,26510,53141,99840,177811,302759,496128,
%T A030508 786545,1211476,1819136,2670647,3842461,5429083,7546084,10333440,
%U A030508 13959209,18623545,24563096,32055772,41425920,53049910,67362149
%N A030508 Graham-Sloane-type lower bound on the size of a ternary (n,3,8) constant-weight 
               code.
%H A030508 M. Svanstrom, <a href="http://www.dtr.isy.liu.se/dtr/staff/mattias">A 
               lower bound for ternary constant weight codes</a>, IEEE Trans. on 
               Information Theory, Vol. 43, pp. 1630-1632, Sep. 1997.
%F A030508 a(n) = ceil (binomial (n, w) * 2^w / (2*n + 1))
%Y A030508 Sequence in context: A104265 A068880 A053883 this_sequence A006215 A060633 
               A125353
%Y A030508 Adjacent sequences: A030505 A030506 A030507 this_sequence A030509 A030510 
               A030511
%K A030508 nonn
%O A030508 8,1
%A A030508 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