cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A381866 Number of labeled histories for rooted 5-furcating trees with 4n+1 leaves if simultaneous 5-furcations are not allowed.

Original entry on oeis.org

1, 1, 126, 162162, 1003458456, 20419376121144, 1084881453316380720, 128835096988586792403600, 30577206578883234961900809600, 13328512616115465470187677202211200, 9988360697491697592427704919982668857600, 12203369577406758958826880335333105520792518400
Offset: 0

Views

Author

Noah A Rosenberg, Mar 08 2025

Keywords

Crossrefs

Cf. A006472, A339411, A381536 for bifurcating, trifurcating, and quadfurcating trees; A381533 if simultaneity is allowed.
Cf. A007696.

Programs

  • Mathematica
    a[n_]:=((4*n+1)!/120^n)*Product[(4*i-3),{i,n}]; Array[a,11,0] (* Stefano Spezia, Mar 09 2025 *)

Formula

a(n) = ((4*n+1)!/120^n) * Product_{i=1..n} (4*i-3).
a(n) = Gamma(4*n+2)*Gamma(n+1/4)/(30^n*Gamma(1/4)). - Stefano Spezia, Mar 09 2025
a(n) = A007696(n)*(4*n+1)!/120^n. - Alois P. Heinz, Mar 10 2025
Showing 1-1 of 1 results.