A348822 -id:A348822 - cp's OEIS frontend

A348821 a(n) = number of chord labeled loopless diagrams by number of K_6.

0, 1, 5812, 276154969, 39738077935264, 14571371516350429940, 11876790400066163254723167, 19372051918038657958659363247949, 58256941603805590330534264712744407687, 302616041649108508974263266688425815263488561, 2575195630881373033515248134269171034879932771154311

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

Row 6 of A369923.

Cf. A190835, A348822, A348823; A003436, A348813, A348815, A348818.

a(8) 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.

A348819 a(n) = number of loopless diagrams by number of K_5 up to rotational symmetry.

Original entry on oeis.org

0, 1, 60, 222477, 2211192688, 48357603758012, 2059392303708166507, 155876203880714141444480

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, A348820; A007474, A348814, A348816, A348822.

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.

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

A348821 a(n) = number of chord labeled loopless diagrams by number of K_6.

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

A348819 a(n) = number of loopless diagrams by number of K_5 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

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

Views

Author

Keywords

Links

Crossrefs