|
| |
|
|
A133721
|
|
Triangle read by rows: T(m,n) = number of n-balanced and minimal labeled covers of a finite set of m unlabeled elements (m >= 1, 1 <= n <= m).
|
|
5
| |
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 7, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 10, 1, 13, 1, 1, 1, 1, 1, 1, 1, 25, 7, 1, 1, 1, 1, 1, 1, 1, 15, 6, 3, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 13, 1, 1, 1, 1, 1, 1, 1, 1, 21, 65, 81, 7, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,12
|
|
|
REFERENCES
| A. P. Burger and J. H. van Vuuren, Balanced minimal covers of a finite set, Discr. Math. 307 (2007), 2853-2860.
|
|
|
EXAMPLE
| Triangle begins:
1
1 1
1 1 1
1 1 1 1
1 3 1 1 1
1 1 1 1 1 1
1 6 7 1 1 1 1
1 1 3 1 1 1 1 1
1 10 1 13 1 1 1 1 1
1 1 25 7 1 1 1 1 1 1
1 15 6 3 22 1 1 1 1 1 1
|
|
|
MAPLE
| A133721 := proc(m, n)
l := ceil(m/n) ;
c := n*ceil(m/n)-m ;
A133713(l, c) ;
end proc: # R. J. Mathar, Nov 23 2011
|
|
|
CROSSREFS
| Cf. A133709. Column n=2 is essentially A000217. Columns 3, 4, 5, 6 give A133722, A133723, A133724, A133733.
Sequence in context: A030577 A070670 A049586 * A083202 A030560 A030559
Adjacent sequences: A133718 A133719 A133720 * A133722 A133723 A133724
|
|
|
KEYWORD
| nonn,tabl
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Dec 30 2007
|
| |
|
|
