cp's OEIS Frontend

A054341 Row sums of triangle A054336 (central binomial convolutions).

%I A054341 #58 Jan 23 2024 09:18:38
%S A054341 1,2,5,12,30,74,185,460,1150,2868,7170,17904,44760,111834,279585,
%T A054341 698748,1746870,4366460,10916150,27287944,68219860,170541252,
%U A054341 426353130,1065853432,2664633580,6661479944,16653699860,41633878200,104084695500,260210401530,650526003825
%N A054341 Row sums of triangle A054336 (central binomial convolutions).
%C A054341 a(n) = # Dyck (n+1)-paths all of whose components are symmetric. A strict Dyck path is one with exactly one return to ground level (necessarily at the end). Every nonempty Dyck path is expressible uniquely as a concatenation of one or more strict Dyck paths, called its components. - _David Callan_, Mar 02 2005
%C A054341 a(n) = # 2-Motzkin paths (i.e., Motzkin paths with blue and red level steps) with no level steps at positive height. Example: a(2)=5 because, denoting U=(1,1), D=(1,-1), B=blue (1,0), R=red (1,0), we have BB, BR, RB, RR, and UD. - _Emeric Deutsch_, Jun 07 2011
%C A054341 Inverse Chebyshev transform of the second kind applied to 2^n. This maps g(x) -> c(x^2)g(xc(x^2)). - _Paul Barry_, Sep 14 2005
%C A054341 Hankel transform of this sequence gives A000012 = [1,1,1,1,1,1,1,...]. - _Philippe Deléham_, Oct 24 2007
%C A054341 Inverse binomial transform of A059738. - _Philippe Deléham_, Nov 24 2009
%H A054341 Alois P. Heinz, <a href="/A054341/b054341.txt">Table of n, a(n) for n = 0..2513</a> (first 201 terms from Vincenzo Librandi)
%H A054341 Paul Barry, <a href="https://www.emis.de/journals/JIS/VOL22/Barry1/barry411.html">The Central Coefficients of a Family of Pascal-like Triangles and Colored Lattice Paths</a>, J. Int. Seq., Vol. 22 (2019), Article 19.1.3.
%H A054341 Isaac DeJager, Madeleine Naquin, Frank Seidl, <a href="https://www.valpo.edu/mathematics-statistics/files/2019/08/Drube2019.pdf">Colored Motzkin Paths of Higher Order</a>, VERUM 2019.
%H A054341 J. W. Layman, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL4/LAYMAN/hankel.html">The Hankel Transform and Some of its Properties</a>, J. Integer Sequences, 4 (2001), #01.1.5.
%F A054341 a(n) = Sum_{m=0..n} A054336(n, m).
%F A054341 G.f.: 1/(1-2*x-x^2*c(x^2)), where c(x) = g.f. for Catalan numbers A000108.
%F A054341 From_Paul Barry_, Sep 14 2005: (Start)
%F A054341 G.f.: c(x^2)/(1-2*x*c(x^2));
%F A054341 a(n) = Sum_{k=0..n} binomial(n,(n-k)/2)*(1 + (-1)^(n+k))*2^k*(k+1)/(n+k+2). (End)
%F A054341 G.f.: 2/(1-4*x+sqrt(1-4*x^2)). - _Ira M. Gessel_, Oct 27 2013
%F A054341 a(n) = A127358(n+1) - 2*A127358(n). - _Philippe Deléham_, Mar 02 2007
%F A054341 a(n) = A126075(n,0). - _Philippe Deléham_, Nov 24 2009
%F A054341 a(n) = Sum_{k=0..n} A053121(n,k)*2^k. - _Philippe Deléham_, Nov 28 2009
%F A054341 From _Gary W. Adamson_, Sep 07 2011: (Start)
%F A054341 a(n) is the upper left term of M^n, M is an infinite square production matrix as follows:
%F A054341   2, 1, 0, 0, 0, ...
%F A054341   1, 0, 2, 0, 0, ...
%F A054341   0, 1, 0, 1, 0, ...
%F A054341   0, 0, 1, 0, 1, ...
%F A054341   0, 0, 0, 1, 0, ...
%F A054341   ... (End)
%F A054341 Conjecture: 2*(n+1)*a(n) +5*(-n-1)*a(n-1) +8*(-n+2)*a(n-2) +20*(n-2)*a(n-3)=0. - _R. J. Mathar_, Nov 30 2012
%F A054341 a(n) ~ 3 * 5^n / 2^(n+2). - _Vaclav Kotesovec_, Feb 13 2014
%e A054341 a(4) = 30, the upper left term of M^4.
%p A054341 b:= proc(x, y) option remember; `if`(x=0, 1,
%p A054341       b(x-1, 0)+`if`(y>0, b(x-1, y-1), 0)+b(x-1, y+1))
%p A054341     end:
%p A054341 a:= n-> b(n, 0):
%p A054341 seq(a(n), n=0..31);  # _Alois P. Heinz_, Jan 23 2024
%t A054341 CoefficientList[Series[2/(1-4*x+Sqrt[1-4*x^2]), {x, 0, 20}], x] (* _Vaclav Kotesovec_, Feb 13 2014 *)
%Y A054341 Cf. A000108, A054336.
%K A054341 easy,nonn
%O A054341 0,2
%A A054341 _Wolfdieter Lang_, Mar 13 2000