|
Search: id:A049056
|
|
|
| A049056 |
|
Number of minimal ordered covers of a labeled n-set. |
|
+0
2
|
|
| 1, 1, 3, 19, 207, 3691, 103263, 4415419, 283796607, 27094905451, 3813398797023, 786844659227419, 237151202183603007, 104128385332221915211, 66478899089080159079583, 61624041121329496987905019
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
R. J. Clarke, Covering a set by subsets, Discrete Math., 81 (1990), 147-152.
|
|
FORMULA
|
E.g.f.: Sum((exp(x)-1)^n*exp(x*(2^n-n-1)), n=0..infinity), cf. A046165. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 01 2005
|
|
PROGRAM
|
(PARI) {a(n)=sum(k=0, n, sum(i=0, k, (-1)^i*binomial(k, i)*(2^k-1-i)^n))} /* Michael Somos Oct 16 2006 */
|
|
CROSSREFS
|
Row sums of A049055.
Adjacent sequences: A049053 A049054 A049055 this_sequence A049057 A049058 A049059
Sequence in context: A108993 A052886 A079144 this_sequence A000275 A058165 A074707
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas, Michael Somos
|
|
|
Search completed in 0.002 seconds
|
