login
A369822
Number of (undirected) Eulerian cycles in the (2n)-dipyramid graph.
1
6, 372, 68880, 26310816, 17145457920, 17034981004800, 23977057921689600, 45400487332999680000, 111298452508871250739200, 342962787786595749642240000, 1297585985940925048243814400000, 5913686127296455213253427855360000, 31954282139197508581861513887744000000
OFFSET
1,1
COMMENTS
Sequence extended to a(1) using the formula. - Eric W. Weisstein, Sep 06 2025
LINKS
Eric Weisstein's World of Mathematics, Dipyramidal Graph.
Eric Weisstein's World of Mathematics, Eulerian Cycle.
FORMULA
a(n) = n!*(n-1)!*(2^(2*n)*Sum_{k=0..n} binomial(2*n, 2*k)*binomial(2*k, k) - binomial(2*n, n) - 4*Sum_{q=0..2*n-2} binomial(q, floor(q/2)) * A193858(2*n-2, q)). - Andrew Howroyd, Feb 18 2024
a(n) ~ sqrt(Pi) * 2^(2*n + 1/2) * 3^(2*n - 1/2) * n^(2*n - 1/2) / exp(2*n). - Vaclav Kotesovec, Feb 07 2026
EXAMPLE
a(1) = 6 because the 2-dipyramid graph is the graph {A-B,A-C,B-C,B--C,B-D,C-D} (There are 2 different edges connecting vertex B and C), there are a(1) = 6 Eulerian cycles: {A-B-C--B-D-C-A,A-B--C-B-D-C-A,A-B-D-C--B-C-A,A-B-D-C-B--C-A,A-B-C-D-B--C-A,A-B--C-D-B-C-A}. - Zhuorui He, Oct 30 2025
MATHEMATICA
Table[n! (n - 1)! (4^n Hypergeometric2F1[1/2 - n, -n, 1, 4] - Binomial[2 n, n] - 4 Sum[2^(2 n - 2) Binomial[2 n - 2, q] Binomial[q, Floor[q/2]] Hypergeometric2F1[1, -q, 2 - 2 n, 1/2], {q, 0, 2 n - 2}]), {n, 20}] (* Eric W. Weisstein, Sep 06 2025 *)
PROG
(PARI) \\ B(n, k) is A193858(n, k)
B(m, q)={sum(j=0, q, 2^(m-j) * binomial(m-j, q-j))}
a(n)={n!*(n-1)!*(2^(2*n)*sum(k=0, n, binomial(2*n, 2*k)*binomial(2*k, k)) - binomial(2*n, n) - 4*sum(q=0, 2*n-2, binomial(q, q\2) * B(2*n-2, q)))} \\ Andrew Howroyd, Feb 18 2024
CROSSREFS
Cf. A193858.
Sequence in context: A355752 A099595 A158041 * A233212 A270558 A245398
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, Feb 02 2024
EXTENSIONS
a(5) from Max Alekseyev, Feb 17 2024
a(6) onwards from Andrew Howroyd, Feb 17 2024
a(1) prepended by Eric W. Weisstein, Sep 06 2025
STATUS
approved