|
%I #7 Jan 20 2024 13:52:23
%S 1,1,2,14,396,34748,9281784,7454765736,17754713559696,
%T 124916711439302928,2595833697671445752352,
%U 159598823327470451154007008,29105164897431888477084463394496,15784299558159474546700473641953798080,25515085085573055700779453120708128026732416
%N Number of n-node labeled oriented graphs whose underlying graphs are mating graphs, cf. A006024.
%H Andrew Howroyd, <a href="/A102596/b102596.txt">Table of n, a(n) for n = 0..50</a>
%F a(n) = Sum_{k>=0} 2^k * A369283(n,k). - _Andrew Howroyd_, Jan 20 2024
%o (PARI) permcount, edges defined in A369283.
%o 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
%Y Cf. A006024, A102579 (digraphs), A102597 (connected), A102599, A369283.
%K nonn
%O 0,3
%A Goran Kilibarda, Zoran Maksimovic, _Vladeta Jovovic_, Jan 22 2005
%E a(0)=1 prepended and a(13) onwards from _Andrew Howroyd_, Jan 20 2024
|
