A102596 Number of n-node labeled oriented graphs whose underlying graphs are mating graphs, cf. A006024.

1, 1, 2, 14, 396, 34748, 9281784, 7454765736, 17754713559696, 124916711439302928, 2595833697671445752352, 159598823327470451154007008, 29105164897431888477084463394496, 15784299558159474546700473641953798080, 25515085085573055700779453120708128026732416

Offset

0,3

Links

Andrew Howroyd, Table of n, a(n) for n = 0..50

Formula

a(n) = Sum_{k>=0} 2^k * A369283(n,k). - Andrew Howroyd, Jan 20 2024

Prog

(PARI) permcount, edges defined in A369283.
a(n) = {my(s=0); forpart(p=n, s += permcount(p)*(-1)^(n-#p)*edges(p, w->1 + 2^w)); s} \\ Andrew Howroyd, Jan 20 2024

Crossrefs

Cf. A006024, A102579 (digraphs), A102597 (connected), A102599, A369283.

Sequence in context: A011809 A228852 A242876 * A354465 A050561 A346082

Adjacent sequences: A102593 A102594 A102595 * A102597 A102598 A102599

Keyword

nonn

Author

Goran Kilibarda, Zoran Maksimovic, Vladeta Jovovic, Jan 22 2005

Extensions

a(0)=1 prepended and a(13) onwards from Andrew Howroyd, Jan 20 2024

Status

approved