|
Search: id:A036838
|
|
|
| A036838 |
|
Triangle read by rows: T(n,k) = value of Schoenheim bound L_1(n+2,k+2,k+1) on covering numbers (0 <= k <= n). |
|
+0
12
|
|
| 1, 2, 1, 2, 3, 1, 3, 4, 4, 1, 3, 6, 6, 5, 1, 4, 7, 11, 9, 6, 1, 4, 11, 14, 18, 12, 7, 1, 5, 12, 25, 26, 27, 16, 8, 1, 5, 17, 30, 50, 44, 39, 20, 9, 1, 6, 19, 47, 66, 92, 70, 54, 25, 10, 1, 6, 24, 57, 113, 132, 158, 105, 72, 30, 11, 1, 7, 26, 78, 149, 245, 246
(list; table; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
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
|
|
EXAMPLE
|
1; 2,1; 2,3,1; 3,4,4,1; 3,6,6,5,1; ...
|
|
MAPLE
|
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;
|
|
CROSSREFS
|
Columns give A011975, A036831, A036832, A036833, A036834, A036835, A036836, A014125, A036830, A036837.
Sequence in context: A072851 A103627 A080786 this_sequence A066010 A109974 A026820
Adjacent sequences: A036835 A036836 A036837 this_sequence A036839 A036840 A036841
|
|
KEYWORD
|
nonn,tabl,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 11 2002
|
|
|
Search completed in 0.002 seconds
|
