login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(n) = number of chord labeled loopless diagrams by number of K_5.
7

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

%S 0,1,866,4446741,55279816356,1450728060971387,72078730629785795963,

%T 6235048155225093080061949,879601407931825739964190440635,

%U 192100729970218737700046212217095291,62258393664270652226502315136978421947948,28913744296806659870889046765907226809528931041

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

%H Andrew Howroyd, <a href="/A348818/b348818.txt">Table of n, a(n) for n = 1..100</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 4.

%Y Row 5 of A369923.

%Y Cf. A190833, A348819, A348820; A003436, A348813, A348815, A348821.

%K nonn

%O 1,3

%A _Michael De Vlieger_, Nov 01 2021

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