A348819 -id:A348819 - cp's OEIS frontend

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

0, 1, 866, 4446741, 55279816356, 1450728060971387, 72078730629785795963, 6235048155225093080061949, 879601407931825739964190440635, 192100729970218737700046212217095291, 62258393664270652226502315136978421947948, 28913744296806659870889046765907226809528931041

Offset: 1

Michael De Vlieger, Nov 01 2021

nonn

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

Row 5 of A369923.

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

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

A348816 a(n) = number of loopless diagrams by number of K_4 up to rotational symmetry.

Original entry on oeis.org

0, 1, 15, 4790, 4151415, 6619291247, 17510518983528, 71631394311300461, 429426878302882412435, 3616596939726424941979785

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, A348817; A007474, A348814, A348819, A348822.

A348822 a(n) = number of loopless diagrams by number of K_6 up to rotational symmetry.

Original entry on oeis.org

0, 1, 335, 11508322, 1324603148183, 404760320241653655, 282780723811372935744420

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, A348823; A007474, A348814, A348816, A348819.

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.

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.

cp's OEIS Frontend

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

Views

Author

Keywords

Links

Crossrefs

Extensions

A348816 a(n) = number of loopless diagrams by number of K_4 up to rotational symmetry.

Views

Author

Keywords

Links

Crossrefs

A348822 a(n) = number of loopless diagrams by number of K_6 up to rotational symmetry.

Views

Author

Keywords

Links

Crossrefs

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

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