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.
%I A026134 #16 Mar 01 2024 10:38:09
%S A026134 1,2,6,16,44,120,329,904,2493,6898,19151,53340,149019,417522,1172979,
%T A026134 3303696,9326931,26390070,74824584,212565864,604972998,1724739940,
%U A026134 4925066567,14085122376,40339596755,115688495806,332203673142,955090832416,2749055259956,7921280088744
%N A026134 a(n) = Sum_{k=1..n} T(k, k-1), where T is the array in A026120.
%H A026134 Ricardo Gómez Aíza, <a href="https://arxiv.org/abs/2402.16111">Trees with flowers: A catalog of integer partition and integer composition trees with their asymptotic analysis</a>, arXiv:2402.16111 [math.CO], 2024. See p. 21.
%F A026134 G.f.: z(1-z)M^3, with M the g.f. of the Motzkin numbers (A001006).
%Y A026134 T(n, n+2), where T is given by A026148, T(n, n-2), where T is the array defined in A026105 and T(n, n+1), where T is given by A026323.
%Y A026134 First differences of A005322.
%Y A026134 Cf. A026123.
%K A026134 nonn
%O A026134 1,2
%A A026134 _Clark Kimberling_
%E A026134 a(25) corrected and more terms from _Sean A. Irvine_, Sep 17 2019