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.

A349408 Number of planar tanglegrams of size n.

Original entry on oeis.org

1, 1, 2, 11, 76, 649, 6173, 63429, 688898, 7808246, 91537482, 1102931565, 13594564857, 170804438005, 2181426973452, 28257128116954, 370581034530685, 4913238656392058, 65773613137623085, 888155942037325535, 12086555915234897267, 165641209243876120135
Offset: 1

Views

Author

Kevin Liu, Nov 16 2021

Keywords

Examples

			For n=4, there are 11 planar tanglegrams of size 4.
		

Crossrefs

Row sums of A349409.

Programs

  • PARI
    \\ here H(n)/x^2 is g.f. of A257887.
    H(n)={(x - x^2 - serreverse(sum(k=0, n+1, (binomial(2*k, k)/(k+1))^2*x^(k+1)) + O(x^(n+3))))/2}
    seq(n)={my(h=H(n-2), p=O(x)); for(n=1, n, p = subst(h + O(x*x^n), x, p) + x + (p^2 + subst(p,x,x^2))/2); Vec(p)} \\ Andrew Howroyd, Nov 18 2021

Formula

G.f.: F(x) satisfies F(x) = H(F(x)) + x + (F(x)^2 + F(x^2))/2 where H(x)/x^2 is the g.f. of A257887.

Extensions

Terms a(11) and beyond from Andrew Howroyd, Nov 18 2021
Showing 1-1 of 1 results.