login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A005330
Certain subgraphs of a directed graph.
(Formerly M3992)
2
1, 5, 40, 644, 21496, 1471460, 204062440, 56865072164, 31688930152696, 35223651007587140, 78001790003385408040, 343983307379873262633284, 3020895063527811952260491896, 52843677532033943174017588842020, 1841795434229559227318546660111716840
OFFSET
2,2
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
E. Andresen, K. Kjeldsen, On certain subgraphs of a complete transitively directed graph, Discrete Math. 14 (1976), no. 2, 103-119.
FORMULA
a(n) = Sum_{i=0..n-2} (C(n-1, i) * p(n-1-i) * Sum_{j=0..n-2-i} (-1)^j * (n-1-i-j) / p(j)) where p(n) = Product_{k=1..n} (2^k-1). - Sean A. Irvine, May 10 2016
PROG
(PARI) p(n) = prod(k=1, n, 2^k-1);
a(n) = sum(i=0, n-2, binomial(n-1, i) * p(n-1-i) * sum(j=0, n-2-i, (-1)^j * (n-1-i-j) / p(j))); \\ Michel Marcus, May 10 2016
CROSSREFS
Sequence in context: A280572 A217904 A357796 * A003084 A010573 A326265
KEYWORD
nonn
EXTENSIONS
More terms from Sean A. Irvine, May 10 2016
STATUS
approved