A362169 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A362169

a(n) = the hypergraph Catalan number C_4(n).

1, 1, 70, 15225, 7043750, 6327749750, 10411817136000, 29034031694460625, 126890003304310093750, 816448082514611102718750, 7379204202189710013311562500, 90369225128606332243844280406250, 1457163640851863433667228849319062500, 30217741884769257764596041337071409375000

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

Let m >= 1. The sequence of hypergraph Catalan numbers {C_m(n): n >= 0} is defined in terms of counting walks on trees, weighted by the orders of their automorphism groups. See Gunnells. When m = 1 we get the sequence of Catalan numbers A000108. The present sequence is the case m = 4.

Gunnells gives several combinatorial interpretations of the hypergraph Catalan numbers, a method to compute their generating functions to arbitrary precision and some conjectural asymptotics.

LINKS

Andrew Howroyd, Table of n, a(n) for n = 0..100

Paul E. Gunnells, Generalized Catalan numbers from hypergraphs, arXiv:2102.05121 [math.CO], 2021.

FORMULA

a(n) ~ sqrt(2) * (32/3)^n * n!^3/(Pi*n)^(3/2) (conjectural).

PROG

(PARI) Vec(HypCatColGf(4, 15)) \\ HypCatColGf defined in A369288. - Andrew Howroyd, Feb 01 2024

CROSSREFS

Column k=4 of A369288.

Cf. A000055, A000108, A362167, A362168, A362170, A362171, A362172.

Sequence in context: A330244 A362916 A229776 * A231054 A007100 A103157

Adjacent sequences: A362166 A362167 A362168 * A362170 A362171 A362172