A292409 -id:A292409 - cp's OEIS frontend

A348813 a(n) = number of chord labeled loopless diagrams by number of K_3.

0, 1, 22, 1415, 140343, 20167651, 3980871156, 1035707510307, 343866839138005, 141979144588872613, 71386289535825383386, 42954342000612934599071, 30482693813120122213093587, 25196997894058490607106028095, 24001522306527907199721466108488, 26102037346800387738363882455862531

Offset: 1

Michael De Vlieger, Nov 01 2021

nonn

Andrew Howroyd, Table of n, a(n) for n = 1..200
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 2.

Row 3 of A369923.

Cf. A190826, A348814, A292409; A003436, A348815, A348818, A348821.

a(14) onwards from Andrew Howroyd, Feb 05 2024

A348814 a(n) = number of loopless diagrams by number of K_3 up to rotational symmetry.

Original entry on oeis.org

0, 1, 4, 126, 9367, 1120780, 189565588, 43154533233, 12735808866899, 4732638168795171, 2163220895025390670, 1193176166690983987122, 781607533669746761791541

Offset: 1

Michael De Vlieger, Nov 01 2021

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 2.

Cf. A190826, A292409, A348813; A007474, A348816, A348819, A348822.

A348817 a(n) = number of loopless diagrams by number of K_4 up to all symmetries.

Original entry on oeis.org

0, 1, 13, 2576, 2081393, 3309962320, 8755277273334, 35815698613833466, 214713439275724149414, 1808298469877117320495867

Offset: 1

Michael De Vlieger, Nov 01 2021

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 3.

Cf. A190830, A348815, A348816; A003437, A292409, A348820, A348823.

A348820 a(n) = number of loopless diagrams by number of K_5 up to all symmetries.

Original entry on oeis.org

0, 1, 42, 112418, 1105696796, 24178822553773, 1029696155560021174, 77938101941693076258854

Offset: 1

Michael De Vlieger, Nov 01 2021

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 4.

Cf. A190833, A348818, A348819; A003437, A292409, A348817, A348823.

A348823 a(n) = number of loopless diagrams by number of K_6 up to all symmetries.

Original entry on oeis.org

0, 1, 203, 5765385, 662305416760, 202380163158922023, 141390361908351519807928

Offset: 1

Michael De Vlieger, Nov 01 2021

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.

Cf. A190835, A348821, A348822; A003437, A292409, A348817, A348820.

cp's OEIS Frontend

A348813 a(n) = number of chord labeled loopless diagrams by number of K_3.

Views

Author

Keywords

Links

Crossrefs

Extensions

A348814 a(n) = number of loopless diagrams by number of K_3 up to rotational symmetry.

Views

Author

Keywords

Links

Crossrefs

A348817 a(n) = number of loopless diagrams by number of K_4 up to all symmetries.

Views

Author

Keywords

Links

Crossrefs

A348820 a(n) = number of loopless diagrams by number of K_5 up to all symmetries.

Views

Author

Keywords

Links

Crossrefs

A348823 a(n) = number of loopless diagrams by number of K_6 up to all symmetries.

Views

Author

Keywords

Links

Crossrefs