A348817 -id:A348817 - cp's OEIS frontend

A348815 a(n) = number of chord labeled loopless diagrams by number of K_4.

0, 1, 134, 75843, 83002866, 158861646466, 490294453324924, 2292204611710892971, 15459367618357013402267, 144663877588996810362218074, 1819753109993633276315632934129, 29976383544377113242613349012354566, 632574848906117234957565158900144038734

Offset: 1

Michael De Vlieger, Nov 01 2021

nonn

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

Row 4 of A369923.

Cf. A190830, A348816, A348817; A003436, A348813, A348818, A348821.

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

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

A348815 a(n) = number of chord labeled loopless diagrams by number of K_4.

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

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