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.

A372852 a(n) is the total number of runs of ascents over all flattened Catalan words of length n.

Original entry on oeis.org

1, 3, 10, 35, 123, 427, 1460, 4923, 16405, 54131, 177150, 575731, 1860047, 5978715, 19131880, 60982859, 193710249, 613415779, 1937102450, 6101872707, 19177314211, 60147030923, 188286357660, 588394867675, 1835791987133, 5719198113747, 17793060798310, 55285581766163
Offset: 1

Views

Author

Stefano Spezia, May 15 2024

Keywords

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{8,-22,24,-9},{1,3,10,35},28]

Formula

From Baril et al.: (Start)
G.f.: x*(1 - 5*x + 8*x^2 - 3*x^2)/((1 - x)^2*(1 - 3*x)^2).
a(n) = (3^(n-1) + 1)*(n + 1)/4. (End)
E.g.f.: exp(x)*(exp(2*x) - 1)*(x - 2)/4.