This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A036830 #15 Feb 02 2020 21:04:55 %S A036830 3,7,14,26,44,70,105,152,213,291,388,508,654,829,1037,1281,1566,1896, %T A036830 2276,2710,3203,3761,4388,5091,5875,6746,7710,8774,9944,11228,12632, %U A036830 14164,15831,17641,19602,21722,24009,26472,29120,31961,35005 %N A036830 Schoenheim bound L_1(n,n-4,n-5). %D A036830 W. H. Mills and R. C. Mullin, Coverings and packings, pp. 371-399 of Jeffrey H. Dinitz and D. R. Stinson, editors, Contemporary Design Theory, Wiley, 1992. See Eq. 1. %H A036830 <a href="/index/Cor#covnum">Index entries for covering numbers</a> %F A036830 a(6)=3; a(n) = ceiling(n/(n-4)*a(n-1)). - _Benoit Cloitre_, May 31 2003 %p A036830 A036830 := proc(n) local i,t1; t1 := 1; for i from 6 to n do t1 := ceil(t1*i/(i-4)); od: t1; end; %p A036830 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) %o A036830 (PARI) a(n)=if(n<7,3,ceil(n/(n-4)*a(n-1))) %Y A036830 Lower bound to A066225. %Y A036830 A column of A036838. %K A036830 nonn %O A036830 6,1 %A A036830 _N. J. A. Sloane_, Jan 11 2002