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”).

A020564
Number of cyclic oriented multigraphs on n labeled arcs (without loops).
0
1, 1, 7, 88, 1686, 44746, 1550780, 67381560, 3562868722, 224113484498, 16473080538422, 1394549071911392, 134354292707375708, 14583554691197056644, 1768268298908733087440, 237735747822259634293456, 35212913676142942896961116
OFFSET
0,3
LINKS
G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004. [Cached copy, with permission]
FORMULA
a(n) = Sum_{k=0..n} (-1)^(n-k)*Stirling1(n, k)*A014505(k). - Sean A. Irvine, Apr 25 2019
CROSSREFS
Cf. A008275 (Stirling1), A014505.
Sequence in context: A296735 A137143 A069430 * A006291 A220193 A220357
KEYWORD
nonn
AUTHOR
Gilbert Labelle (gilbert(AT)lacim.uqam.ca), Simon Plouffe
STATUS
approved