OFFSET
0,3
COMMENTS
A noncrossing caterpillar is a noncrossing tree that is a caterpillar tree (also called a caterpillar graph).
The number of nodes is n + 1. All trees up to 5 edges (or 6 nodes) are caterpillars.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..1000
Eric Weisstein's World of Mathematics, Caterpillar Graph.
Wikipedia, Caterpillar tree.
Index entries for linear recurrences with constant coefficients, signature (12,-52,104,-114,76,-32,8,-1).
FORMULA
a(n) = 12*a(n-1) - 52*a(n-2) + 104*a(n-3) - 114*a(n-4) + 76*a(n-5) - 32*a(n-6) + 8*a(n-7) - a(n-8) for n >= 8.
G.f.: (1 - 11*x + 43*x^2 - 76*x^3 + 77*x^4 - 37*x^5 + 6*x^6)/((1 - x)^2*(1 - 5*x + 3*x^2 - x^3)^2).
G.f.: 1 + x + x^2*(3 - 2*x + (4 - 3*x + x^2)*F(x) + (1 + 2*x)*F(x)^2)/(1 - x)^2 where F(x) = x*(2 - x)/(1 - 5*x + 3*x^2 - x^3).
PROG
(PARI) Vec((1 - 11*x + 43*x^2 - 76*x^3 + 77*x^4 - 37*x^5 + 6*x^6)/((1 - x)^2*(1 - 5*x + 3*x^2 - x^3)^2) + O(x^30))
CROSSREFS
Row sums of A361357.
KEYWORD
nonn,easy
AUTHOR
Andrew Howroyd, Mar 09 2023
STATUS
approved