A338978 Number of labeled 5-regular graphs on 2n nodes.

1, 0, 0, 1, 3507, 66462606, 2977635137862, 283097260184159421, 52469332407700365320163, 17647883828569858659972268092, 10148613081040117624319536901932188, 9494356410654311931931879706070629989407, 13859154719468565627065764000731047706917194485

Offset

0,5

Links

Marni Mishna, Table of n, a(n) for n = 0..110 (first 51 terms from Brendan Mackay)

Frédéric Chyzak and Marni Mishna, Differential equations satisfied by generating functions of 5-, 6-, and 7-regular labelled graphs: a reduction based approach, arXiv:2406.04753 [math.CO], 2024.

Élie de Panafieu, Asymptotic expansion of regular and connected regular graphs, arXiv:2408.12459 [math.CO], 2024. See p. 9.

Atabey Kaygun, Counting Graphs with a Prescribed Degree Sequence.

Atabey Kaygun, Enumerating Labeled Graphs that Realize a Fixed Degree Sequence, arXiv:2101.02299 [math.CO], 2021.

Crossrefs

With interspersed zeros, column k=5 of A059441.

Cf. A001205, A002829, A005815, A165626 (unlabeled case).

Sequence in context: A203845 A257316 A224724 * A274237 A053804 A338392

Adjacent sequences: A338975 A338976 A338977 * A338979 A338980 A338981

Keyword

nonn

Author

Atabey Kaygun, Dec 18 2020

Status

approved