A098623
Consider the family of directed multigraphs enriched by the species of set partitions. Sequence gives number of those multigraphs with n labeled arcs.
Original entry on oeis.org
1, 1, 8, 109, 2229, 62684, 2289151, 104344153, 5767234550, 378073098155, 28888082263581, 2536660090249102, 253007765488793325, 28383529110762969901, 3551558435250676339536, 492092920443604792460905, 75025155137863150912784409, 12516480979952118669729618300
Offset: 0
- G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
- Andrew Howroyd, Table of n, a(n) for n = 0..200
- G. Labelle, Counting enriched multigraphs according to the number of their edges (or arcs), Discrete Math., 217 (2000), 237-248.
- G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004. [Cached copy, with permission]
-
\\ here R(n) is A000110 as e.g.f.
egfA020556(n)={my(bell=serlaplace(exp(exp(x + O(x^(2*n+1)))-1))); sum(i=0, n, sum(k=0, i, (-1)^k*binomial(i, k)*polcoef(bell, 2*i-k))*x^i/i!) + O(x*x^n)}
EnrichedGdSeq(R)={my(n=serprec(R, x)-1, B=subst(egfA020556(n), x, log(1+x + O(x*x^n)))); Vec(serlaplace(subst(B, x, R-polcoef(R,0))))}
R(n)={exp(exp(x + O(x*x^n))-1)}
EnrichedGdSeq(R(20)) \\ Andrew Howroyd, Jan 12 2021
A098627
Consider the family of directed multigraphs enriched by the species of derangements. Sequence gives number of those multigraphs with n labeled arcs.
Original entry on oeis.org
1, 0, 1, 2, 27, 164, 2335, 25458, 437241, 6965112, 145640817, 3057675290, 76814951587, 2003471245164, 59438049704943, 1855131250113498, 63937099992148785, 2327591284996635888, 91854272591000172321, 3828194864278619367474, 170846746588575658999147
Offset: 0
- G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
A098631
Consider the family of directed multigraphs enriched by the species of parts. Sequence gives number of those multigraphs with n labeled arcs.
Original entry on oeis.org
1, 2, 28, 696, 26512, 1402656, 97017792, 8418174848, 889241719040, 111774837350912, 16420543334734848, 2778708477919836160, 535183812199464341504, 116142946557502449852416, 28156854547845767203373056, 7569375509914847295271043072, 2241898693518356603925445017600
Offset: 0
- G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
A098639
Consider the family of directed multigraphs enriched by the species of odd sets. Sequence gives number of those multigraphs with n labeled arcs.
Original entry on oeis.org
1, 1, 6, 69, 1230, 30663, 1005692, 41571127, 2099861244, 126607647073, 8945129371976, 729628409684925, 67868881258920424, 7125522244948969319, 837004398237510194704, 109173596976047915341823, 15708090522743045757716496, 2478722722731315203268137729
Offset: 0
- G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
A099695
Consider the family of directed multigraphs enriched by the species of directed sets. Sequence gives number of those multigraphs with n labeled arcs.
Original entry on oeis.org
1, 1, 8, 106, 2144, 59844, 2173450, 98648246, 5433864078, 355229741266, 27080154837658, 2373310690810690, 236327564463489838, 26475199136060717618, 3308794737926514931894, 457980967372496137472590, 69761664006643652403884218, 11629282648335699139979015070
Offset: 0
- G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
-
\\ R(n) is e.g.f. of 1, 1, 2, 2, 2, ...; EnrichedGdSeq defined in A098623.
R(n)={2*exp(x + O(x*x^n)) - x - 1}
EnrichedGdSeq(R(20)) \\ Andrew Howroyd, Jan 12 2021
A099699
Consider the family of directed multigraphs enriched by the species of involutions. Sequence gives number of those multigraphs with n labeled arcs.
Original entry on oeis.org
1, 1, 8, 108, 2200, 61708, 2249268, 102377404, 5651999688, 370171228504, 28262385542832, 2480108374814480, 247231765611893504, 27722619251007202720, 3467475213036160205984, 480277499859342401636704, 73202023124111697153718080, 12209186681659842887207280448
Offset: 0
- G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.
A020564
Number of cyclic oriented multigraphs on n labeled arcs (without loops).
Original entry on oeis.org
1, 1, 7, 88, 1686, 44746, 1550780, 67381560, 3562868722, 224113484498, 16473080538422, 1394549071911392, 134354292707375708, 14583554691197056644, 1768268298908733087440, 237735747822259634293456, 35212913676142942896961116
Offset: 0
- G. Labelle, Counting enriched multigraphs according to the number of their edges (or arcs), Discrete Math., 217 (2000), 237-248.
- G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004. [Cached copy, with permission]
Showing 1-7 of 7 results.