Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036830
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036830 Schoenheim bound L_1(n,n-4,n-5). +0
3
3, 7, 14, 26, 44, 70, 105, 152, 213, 291, 388, 508, 654, 829, 1037, 1281, 1566, 1896, 2276, 2710, 3203, 3761, 4388, 5091, 5875, 6746, 7710, 8774, 9944, 11228, 12632, 14164, 15831, 17641, 19602, 21722, 24009, 26472, 29120, 31961, 35005 (list; graph; listen)
OFFSET

6,1

REFERENCES

W. H. Mills and R. C. Mullin, Coverings and packings, pp. 371-399 of J. H. Dinitz and D. R. Stinson, editors,a Contemporary Design Theory, Wiley, 1992. See Eq. 1.

LINKS

Index entries for covering numbers

FORMULA

a(6)=3 a(n)=ceiling(n/(n-4)*a(n-1)) - Benoit Cloitre (benoit7848c(AT)orange.fr), May 31 2003

MAPLE

A036830 := proc(n) local i, t1; t1 := 1; for i from 6 to n do t1 := ceil(t1*i/(i-4)); od: t1; end;

L := proc(v, k, t, l) local i, t1; t1 := l; for i from v-t+1 to v do t1 := ceil(t1*i/(i-(v-k))); od: t1; end; # gives Schoenheim bound L_l(v, k, t)

PROGRAM

(PARI) a(n)=if(n<7, 3, ceil(n/(n-4)*a(n-1)))

CROSSREFS

Lower bound to A066225.

A column of A036838.

Adjacent sequences: A036827 A036828 A036829 this_sequence A036831 A036832 A036833

Sequence in context: A011795 A051170 A008646 this_sequence A014153 A001924 A079921

KEYWORD

nonn

AUTHOR

njas, Jan 11 2002

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research