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”).
%I #14 Feb 01 2024 16:37:04
%S 1,1,924,6358044,203356067376,23345633108619360,
%T 7484535614458774428480,5583028528736289502562408256,
%U 8547031978688473343843434600852224,24503310825110075324451531207978424853568,122607946140627185219752569884701085604290069760
%N a(n) = the hypergraph Catalan number C_6(n).
%C 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 = 6.
%C Gunnells gives several combinatorial interpretations of the hypergraph Catalan numbers, a method to compute their generating functions to arbitrary precision and some conjectural asymptotics.
%H Andrew Howroyd, <a href="/A362171/b362171.txt">Table of n, a(n) for n = 0..100</a>
%H Paul E. Gunnells, <a href="https://arxiv.org/abs/2102.05121">Generalized Catalan numbers from hypergraphs</a>, arXiv:2102.05121 [math.CO], 2021.
%F a(n) ~ sqrt(3)/2 * (6^5/5!)^n * n!^5/(Pi*n)^(5/2) (conjectural)
%Y Column k=6 of A369288.
%Y Cf. A000055, A000108, A362167, A362168, A362169, A362170, A362172.
%K nonn,walk
%O 0,3
%A _Peter Bala_, Apr 10 2023
%E a(6) onwards from _Andrew Howroyd_, Feb 01 2024