login
a(n) = number of chord labeled loopless diagrams by number of K_4.
9

%I #14 Feb 06 2024 00:48:15

%S 0,1,134,75843,83002866,158861646466,490294453324924,

%T 2292204611710892971,15459367618357013402267,

%U 144663877588996810362218074,1819753109993633276315632934129,29976383544377113242613349012354566,632574848906117234957565158900144038734

%N a(n) = number of chord labeled loopless diagrams by number of K_4.

%H Andrew Howroyd, <a href="/A348815/b348815.txt">Table of n, a(n) for n = 1..150</a>

%H Evgeniy Krasko, Igor Labutin, and Alexander Omelchenko, <a href="https://arxiv.org/abs/1709.03218">Enumeration of Labelled and Unlabelled Hamiltonian Cycles in Complete k-partite Graphs</a>, arXiv:1709.03218 [math.CO], 2017. See Appendix Table 3.

%Y Row 4 of A369923.

%Y Cf. A190830, A348816, A348817; A003436, A348813, A348818, A348821.

%K nonn

%O 1,3

%A _Michael De Vlieger_, Nov 01 2021

%E a(11) onwards from _Andrew Howroyd_, Feb 05 2024