login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A348823
a(n) = number of loopless diagrams by number of K_6 up to all symmetries.
4
0, 1, 203, 5765385, 662305416760, 202380163158922023, 141390361908351519807928
OFFSET
1,3
LINKS
Evgeniy Krasko, Igor Labutin, and Alexander Omelchenko, Enumeration of Labelled and Unlabelled Hamiltonian Cycles in Complete k-partite Graphs, arXiv:1709.03218 [math.CO], 2017. See Appendix Table 5.
KEYWORD
nonn,more
AUTHOR
Michael De Vlieger, Nov 01 2021
STATUS
approved