A085880 -id:A085880 - cp's OEIS frontend

A052709 Expansion of g.f. (1-sqrt(1-4x-4x^2))/(2*(1+x)).

0, 1, 1, 3, 9, 31, 113, 431, 1697, 6847, 28161, 117631, 497665, 2128127, 9183489, 39940863, 174897665, 770452479, 3411959809, 15181264895, 67833868289, 304256253951, 1369404661761, 6182858317823, 27995941060609, 127100310290431, 578433619525633, 2638370120138751

Offset: 0

encyclopedia(AT)pommard.inria.fr, Jan 25 2000

A simple context-free grammar.
Number of lattice paths from (0,0) to (2n-2,0) that stay (weakly) in the first quadrant and such that each step is either U=(1,1), D=(1,-1), or L=(3,1). Equivalently, underdiagonal lattice paths from (0,0) to (n-1,n-1) and such that each step is either (1,0), (0,1), or (2,1). E.g., a(4)=9 because in addition to the five Dyck paths from (0,0) to (6,0) [UDUDUD, UDUUDD, UUDDUD, UUDUDD, UUUDDD] we have LDUD, LUDD, ULDD and UDLD. - Emeric Deutsch, Dec 21 2003
Hankel transform of a(n+1) is A006125(n+1). - Paul Barry, Apr 01 2007
Also, a(n+1) is the number of walks from (0,0) to (n,0) using steps (1,1), (1,-1) and (0,-1). See the U(n,k) array in A071943, where A052709(n+1) = U(n,0). - N. J. A. Sloane, Mar 29 2013
Diagonal sums of triangle in A085880. - Philippe Deléham, Nov 15 2013
From Gus Wiseman, Jun 17 2021: (Start)
Conjecture: For n > 0, also the number of sequences of length n - 1 covering an initial interval of positive integers and avoiding three terms (..., x, ..., y, ..., z, ...) such that x <= y <= z. The version avoiding the strict pattern (1,2,3) is A226316. Sequences covering an initial interval are counted by A000670. The a(1) = 1 through a(4) = 9 sequences are:
  ()  (1)  (1,1)  (1,2,1)
           (1,2)  (1,3,2)
           (2,1)  (2,1,1)
                  (2,1,2)
                  (2,1,3)
                  (2,2,1)
                  (2,3,1)
                  (3,1,2)
                  (3,2,1)
(End)

N. J. A. Sloane, Table of n, a(n) for n = 0..499
Marilena Barnabei, Flavio Bonetti, Niccolò Castronuovo, and Matteo Silimbani, Ascending runs in permutations and valued Dyck paths, Ars Mathematica Contemporanea (2019) Vol. 16, No. 2, 445-463.
Paul Barry, Riordan arrays, generalized Narayana triangles, and series reversion, Linear Algebra and its Applications, 491 (2016) 343-385.
Paul Barry, On a transformation of Riordan moment sequences, arXiv:1802.03443 [math.CO], 2018.
Paul Barry, Characterizations of the Borel triangle and Borel polynomials, arXiv:2001.08799 [math.CO], 2020.
Daniel Birmajer, Juan B. Gil, David S. Kenepp, and Michael D. Weiner, Restricted generating trees for weak orderings, arXiv:2108.04302 [math.CO], 2021.
Daniel Birmajer, Juan B. Gil, Peter R. W. McNamara, and Michael D. Weiner, Enumeration of colored Dyck paths via partial Bell polynomials, arXiv:1602.03550 [math.CO], 2016.
Xiang-Ke Chang, X.-B. Hu, H. Lei, and Y.-N. Yeh, Combinatorial proofs of addition formulas, The Electronic Journal of Combinatorics, 23(1) (2016), #P1.8.
Brian Drake, Limits of areas under lattice paths, Discrete Math. 309 (2009), no. 12, 3936-3953.
M. Dziemianczuk, On Directed Lattice Paths With Additional Vertical Steps, arXiv preprint arXiv:1410.5747 [math.CO], 2014.
James East and Nicholas Ham, Lattice paths and submonoids of Z^2, arXiv:1811.05735 [math.CO], 2018.
L. Ferrari, E. Pergola, R. Pinzani, and S. Rinaldi, Jumping succession rules and their generating functions, Discrete Math., 271 (2003), 29-50.
Nancy S. S. Gu, Nelson Y. Li, and Toufik Mansour, 2-Binary trees: bijections and related issues, Discr. Math., 308 (2008), 1209-1221.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 664
J. P. S. Kung and A. de Mier, Catalan lattice paths with rook, bishop and spider steps, Journal of Combinatorial Theory, Series A 120 (2013) 379-389. - _N. J. A. Sloane_, Dec 27 2012
D. Merlini, D. G. Rogers, R. Sprugnoli, and M. C. Verri, On some alternative characterizations of Riordan arrays, Canad. J. Math., 49 (1997), 301-320.

Diagonal entries of A071943 and A071945.
Cf. A000108, A000670, A025227, A052709, A056986, A071943, A085880.
Cf. A102726, A117434, A158005, A226316, A333217, A335479.

[0] cat [(&+[Binomial(n,k+1)*Binomial(2*k,n-1): k in [0..n-1]])/n: n in [1..30]]; // G. C. Greubel, May 30 2022

spec := [S,{C=Prod(B,Z),S=Union(B,C,Z),B=Prod(S,S)},unlabeled]: seq(combstruct[count](spec,size=n), n=0..20);

InverseSeries[Series[(y-y^2)/(1+y^2), {y, 0, 24}], x] (* then A(x)= y(x) *) (* Len Smiley, Apr 12 2000 *)
CoefficientList[Series[(1 -Sqrt[1 -4x -4x^2])/(2(1+x)), {x, 0, 33}], x] (* Vincenzo Librandi, Feb 12 2016 *)

a(n)=polcoeff((1-sqrt(1-4*x*(1+x+O(x^n))))/2/(1+x),n)

[sum(binomial(k, n-k-1)*catalan_number(k) for k in (0..n-1)) for n in (0..30)] # G. C. Greubel, May 30 2022

a(n) + a(n-1) = A025227(n).
a(n) = Sum_{k=0..floor((n-1)/2)} (2*n-2-2*k)!/(k!*(n-k)!*(n-1-2*k)!). - Emeric Deutsch, Nov 14 2001
D-finite with recurrence: n*a(n) = (3*n-6)*a(n-1) + (8*n-18)*a(n-2) + (4*n-12)*a(n-3), n>2. a(1)=a(2)=1.
a(n) = b(1)*a(n-1) + b(2)*a(n-2) + ... + b(n-1)*a(1) for n>1 where b(n)=A025227(n).
G.f.: A(x) = x/(1-(1+x)*A(x)). - Paul D. Hanna, Aug 16 2002
G.f.: A(x) = x/(1-z/(1-z/(1-z/(...)))) where z=x+x^2 (continued fraction). - Paul D. Hanna, Aug 16 2002; revised by Joerg Arndt, Mar 18 2011
a(n+1) = Sum_{k=0..n} Catalan(k)*binomial(k, n-k). - Paul Barry, Feb 22 2005
From Paul Barry, Mar 14 2006: (Start)
G.f. is x*c(x*(1+x)) where c(x) is the g.f. of A000108.
Row sums of A117434. (End)
a(n+1) = (1/(2*Pi))*Integral_{x=2-2*sqrt(2)..2+2*sqrt(2)} x^n*(4+4x-x^2)/(2*(1+x)). - Paul Barry, Apr 01 2007
From Gary W. Adamson, Jul 22 2011: (Start)
For n>0, a(n) is the upper left term in M^(n-1), where M is an infinite square production matrix as follows:
  1, 1, 0, 0, 0, 0, ...
  2, 1, 1, 0, 0, 0, ...
  2, 2, 1, 1, 0, 0, ...
  2, 2, 2, 1, 1, 0, ...
  2, 2, 2, 2, 1, 1, ...
  ... (End)
G.f.: x*Q(0), where Q(k) = 1 + (4*k+1)*x*(1+x)/(k+1 - x*(1+x)*(2*k+2)*(4*k+3)/(2*x*(1+x)*(4*k+3) + (2*k+3)/Q(k+1))); (continued fraction). - Sergei N. Gladkovskii, May 14 2013
a(n) ~ sqrt(2-sqrt(2))*2^(n-1/2)*(1+sqrt(2))^(n-1)/(n^(3/2)*sqrt(Pi)). - Vaclav Kotesovec, Jun 29 2013
a(n+1) = Sum_{k=0..floor(n/2)} A085880(n-k,k). - Philippe Deléham, Nov 15 2013

Better g.f. and recurrence from Michael Somos, Aug 03 2000

More terms from Larry Reeves (larryr(AT)acm.org), Oct 03 2000

A151374 Number of walks within N^2 (the first quadrant of Z^2) starting at (0, 0), ending on the vertical axis and consisting of 2n steps taken from {(-1, -1), (-1, 0), (1, 1)}.

Original entry on oeis.org

1, 2, 8, 40, 224, 1344, 8448, 54912, 366080, 2489344, 17199104, 120393728, 852017152, 6085836800, 43818024960, 317680680960, 2317200261120, 16992801914880, 125210119372800, 926554883358720, 6882979133521920, 51309480813527040, 383705682605506560, 2877792619541299200

Offset: 0

Manuel Kauers, Nov 18 2008

A052701 shifted one place left. - R. J. Mathar, Dec 13 2008
Expansion of c(2*x), where c(x) is the g.f. of A000108. - Philippe Deléham, Feb 26 2009; simplified by Alexander Burstein, Jul 31 2018
From Joerg Arndt, Oct 22 2012: (Start)
Also the number of strings of length 2*n of two different types of balanced parentheses.
For example, a(1) = 2, since the two possible strings of length 2 are [] and (), a(2) = 8, since the 8 possible strings of length 4 are (()), [()], ([]), [[]], ()(), [](), ()[], and [][].
The number of strings of length 2*n of t different types of balanced parentheses is given by t^n * A000108(n): there are n opening parentheses in the strings, giving t^n choices for the type (the closing parentheses are chosen to match). (End)
Number of Dyck paths of length 2n in which the step U=(1,1) come in 2 colors. - José Luis Ramírez Ramírez, Jan 31 2013
Row sums of triangle in A085880. - Philippe Deléham, Nov 15 2013
Hankel transform is 2^(n+n^2) = A053763(n+1). - Philippe Deléham, Nov 15 2013

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Paul Barry, Generalized Eulerian Triangles and Some Special Production Matrices, arXiv:1803.10297 [math.CO], 2018.
Paul Barry, Riordan arrays, the A-matrix, and Somos 4 sequences, arXiv:1912.01126 [math.CO], 2019.
Mireille Bousquet-Mélou and Marni Mishna, Walks with small steps in the quarter plane, arXiv:0810.4387 [math.CO], 2008-2009.
J. Bouttier, P. Di Francesco and E. Guitter, Statistics of planar graphs viewed from a vertex: a study via labeled trees, Nucl. Phys. B, Vol. 675, No. 3 (2003), pp. 631-660. See p. 631, eq. (3.3).
Marek Bożejko, Maciej Dołęga, Wiktor Ejsmont and Światosław R. Gal, Reflection length with two parameters in the asymptotic representation theory of type B/C and applications, arXiv:2104.14530 [math.RT], 2021.
Vedran Čačić and Vjekoslav Kovač, On the fraction of IL formulas that have normal forms, arXiv:1309.3408 [math.LO], 2013.
Stefano Capparelli and Alberto Del Fra, Dyck Paths, Motzkin Paths, and the Binomial Transform, Journal of Integer Sequences, Vol. 18 (2015), Article 15.8.5.
Grégory Chatel and Vincent Pilaud, Cambrian Hopf algebras, Adv. Math. 311, 598-633 (2017). Prop. 3.
Zhi Chen and Hao Pan, Identities involving weighted Catalan-Schröder and Motzkin Paths, arXiv:1608.02448 [math.CO], 2016. See eq. (1.13), a=b=2.
Nicolas Crampe, Julien Gaboriaud and Luc Vinet, Racah algebras, the centralizer Z_n(sl_2) and its Hilbert-Poincaré series, arXiv:2105.01086 [math.RT], 2021.
Hsien-Kuei Hwang, Mihyun Kang and Guan-Huei Duh, Asymptotic Expansions for Sub-Critical Lagrangean Forms, LIPIcs Proceedings of Analysis of Algorithms 2018, Vol. 110, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2018.
Bradley Robert Jones, On tree hook length formulas, Feynman rules and B-series, Master's thesis, Simon Fraser University, 2014.
Georg Muntingh, Implicit Divided Differences, Little Schröder Numbers and Catalan Numbers, J. Int. Seq., Vol. 15 (2012), Article 12.6.5; arXiv preprint, arXiv:1204.2709 [math.CO], 2012.
L. Poulain d'Andecy, Centralisers and Hecke algebras in Representation Theory, with applications to Knots and Physics, arXiv:2304.00850 [math.RT], 2023. See p. 64.

Cf. A000108, A046521, A052701, A053763, A085880.

[2^n * Catalan(n): n in [0..25]]; // Vincenzo Librandi, Oct 24 2012

A151374_list := proc(n) local j, a, w; a := array(0..n); a[0] := 1;
for w from 1 to n do a[w] := 2*(a[w-1]+add(a[j]*a[w-j-1],j=1..w-1)) od;
convert(a,list)end: A151374_list(23); # Peter Luschny, May 19 2011

aux[i_Integer, j_Integer, n_Integer] := Which[Min[i, j, n] < 0 || Max[i, j] > n, 0, n == 0, KroneckerDelta[i, j, n], True, aux[i, j, n] = aux[-1 + i, -1 + j, -1 + n] + aux[1 + i, j, -1 + n] + aux[1 + i, 1 + j, -1 + n]]; Table[Sum[aux[0, k, 2 n], {k, 0, 2 n}], {n, 0, 25}]

my(x='x+O('x^66)); Vec(sqrt(2-8*x-2*sqrt(1-8*x))/(4*x)) \\ Joerg Arndt, May 11 2013

def A151374():
    a, n = 1, 1
    while True:
        yield a
        n += 1
        a = a * (8*n - 12) // n
A = A151374()
print([next(A) for  in range(24)]) # _Peter Luschny, Nov 30 2016

a(n) = 2^n * A000108(n). - Philippe Deléham, Feb 01 2009
From Gary W. Adamson, Jul 12 2011: (Start)
a(n) is the top left term in M^n, M = the following infinite square production matrix:
   2, 2, 0, 0, 0, 0, ...
   2, 2, 2, 0, 0, 0, ...
   2, 2, 2, 2, 0, 0, ...
   2, 2, 2, 2, 2, 0, ...
   2, 2, 2, 2, 2, 2, ...
   ...
(End)
E.g.f.: KummerM(1/2, 2, 8*x). - Peter Luschny, Aug 26 2012
From Sergei N. Gladkovskii, Apr 05 2013: (Start)
E.g.f.: Let F(x)=Sum_{n>=0} a(n)*x^n/(2*n)!, then F(x) = E(0)/(1-sqrt(x)) where E(k) = 1 - sqrt(x)/(1 - sqrt(x)/(sqrt(x) - (k+1)*(k+2)/2/E(k+1) )); (continued fraction ).
G.f.: 1 + 4*x/(G(0)-4*x) where G(k) = k*(8*x+1) + 4*x + 2 - 2*x*(2*k+3)*(2*k+4)/G(k+1); (continued fraction). (End)
G.f.: sqrt(2-8*x-2*sqrt(1-8*x))/(4*x). - Mark van Hoeij, May 10 2013
G.f.: (1-sqrt(1-8*x))/(4*x). - Philippe Deléham, Nov 15 2013
D-finite with recurrence (n+1)*a(n) + 4*(-2*n+1)*a(n-1) = 0. - R. J. Mathar, Mar 05 2014
a(n) = 4^n*2F1((1-n)/2,-n/2;1;1)/(n+1). - Benedict W. J. Irwin, Jul 12 2016
a(n) ~ 8^n*n^(-3/2)/sqrt(Pi). - Ilya Gutkovskiy, Jul 12 2016
From Peter Bala, Aug 17 2021: (Start)
a(n) = Sum_{k = 0..floor(n/2)} A046521(n,2*k)*Catalan(2*k).
G.f.: A(x) = 1/sqrt(1 - 4*x)*e(x/(1 - 4*x)), where e(x) = (c(x) + c(-x))/2 is the even part of the function c(x) = (1 - sqrt(1 - 4*x))/(2*x), the g.f. of the Catalan numbers A000108. Inversely, (c(x) + c(-x))/2 = 1/sqrt(1 + 4*x)*A(x/(1 + 4*x)).
x*A(x) = Series reversion of (x - 2*x^2). (End)
Sum_{n>=0} 1/a(n) = 68/49 + 96*arctan(1/sqrt(7)) / (49*sqrt(7)). - Vaclav Kotesovec, Nov 23 2021
Sum_{n>=0} (-1)^n/a(n) = 20/27 - 16*log(2)/81. - Amiram Eldar, Jan 25 2022
G.f.: 1/(1-2*x/(1-2*x/(1-2*x/(1-2*x/(1-2*x/(1-2*x/(1-2*x/(1-2*x/(1-...))))))))) (continued fraction). - Nikolaos Pantelidis, Nov 20 2022
a(n) = 2*Sum_{k=1..n} a(k-1)*a(n-k), a(0) = 1. - Mehdi Naima, Jan 16 2023

A005159 a(n) = 3^n*Catalan(n).

Original entry on oeis.org

1, 3, 18, 135, 1134, 10206, 96228, 938223, 9382230, 95698746, 991787004, 10413763542, 110546105292, 1184422556700, 12791763612360, 139110429284415, 1522031755700070, 16742349312700770, 185047018719324300, 2054021907784499730

Offset: 0

N. J. A. Sloane, Valery A. Liskovets

Total number of vertices in rooted planar maps with n edges.
Number of blossom trees with n inner vertices.
The number of rooted n-edge maps in the plane (planar with a distinguished outside face). - Valery A. Liskovets, Mar 17 2005
Hankel transform is 3^(n+n^2) = A053764(n+1). - Philippe Deléham, Dec 10 2007
From Joerg Arndt, Oct 22 2012: (Start)
Also the number of strings of length 2*n of three different types of balanced parentheses.
The number of strings of length 2*n of t different types of balanced parentheses is given by t^n * A000108(n): there are n opening parentheses in the strings, giving t^n choices for the type (the closing parentheses are chosen to match). (End)
Number of Dyck paths of length 2n in which the step U=(1,1) come in 3 colors. - José Luis Ramírez Ramírez, Jan 31 2013
Number of unknown entries in bracketed Kleene's truth table connected by the implication with n distinct variables. See Yildiz link. - Michel Marcus, Oct 21 2020

Leonid M. Koganov, Valery A. Liskovets and Timothy R. S. Walsh, Total vertex enumeration in rooted planar maps, Ars Combin., Vol. 54 (2000), pp. 149-160.
Valery A. Liskovets and Timothy R. Walsh, Enumeration of unrooted maps on the plane, Rapport technique, UQAM, No. 2005-01, Montreal, Canada, 2005.
Richard P. Stanley, Catalan Numbers, Cambridge, 2015, p. 107.

T. D. Noe, Table of n, a(n) for n = 0..100
Mireille Bousquet-Mélou, Limit laws for embedded trees, arXiv:math/0501266 [math.CO], 2005.
J. Bouttier, P. Di Francesco and E. Guitter, Statistics of planar graphs viewed from a vertex: a study via labeled trees, Nucl. Phys. B, Vol. 675, No. 3 (2003), pp. 631-660. See p. 631, eq. (3.3).
Zhi Chen and Hao Pan, Identities involving weighted Catalan-Schroder and Motzkin Paths, arXiv:1608.02448 [math.CO], 2016. See eq. (1.13), a=b=3.
Aoife Hennessy, A Study of Riordan Arrays with Applications to Continued Fractions, Orthogonal Polynomials and Lattice Paths, Ph. D. Thesis, Waterford Institute of Technology, Oct. 2011.
Gerard 't Hooft, Counting planar diagrams with various restrictions, Nucl. Phys. B, Vol. 538, No. 1-2 (1999), pp. 389-410; arXiv:hep preprint arXiv:hep-th/9808113, 1998.
Hsien-Kuei Hwang, Mihyun Kang and Guan-Huei Duh, Asymptotic Expansions for Sub-Critical Lagrangean Forms, LIPIcs Proceedings of Analysis of Algorithms 2018, Vol. 110. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2018.
Sergey Kitaev, Anna de Mier and Marc Noy, On the number of self-dual rooted maps, European J. Combin., Vol. 35 (2014), pp. 377-387. MR3090510.
Valery A. Liskovets, A pattern of asymptotic vertex valency distributions in planar maps, J. Combin. Th. B, Vol. 75, No. 1 (1999), pp. 116-133.
Valery A. Liskovets and T. R. Walsh, Counting unrooted maps on the plane, Advances in Applied Math., Vol. 36, No. 4 (2006), pp. 364-387.
Thomas M. Richardson, The three 'R's and Dual Riordan Arrays, arXiv:1609.01193 [math.CO], 2016.
Gilles Schaeffer and Paul Zinn-Justin, On the asymptotic number of plane curves and alternating knots, arXiv:math-ph/0304034, 2003-2004.
Simeon T. Stefanov, Counting fixed points free vector fields on B^2, arXiv:1807.03714 [math.GT], 2018.
Volkan Yildiz, Counting with 3-valued truth tables of bracketed formulae connected by implication, arXiv:2010.10303 [math.GM], 2020.

Cf. A000108, A000244, A025226, A053764, A085880.

Limit of array A102994.

List([0..20],n->3^n*Binomial(2*n,n)/(n+1)); # Muniru A Asiru, Mar 30 2018

[3^n*Catalan(n): n in [0..20]]; // Vincenzo Librandi, Oct 16 2018

A005159_list := proc(n) local j, a, w; a := array(0..n); a[0] := 1;
for w from 1 to n do a[w] := 3*(a[w-1]+add(a[j]*a[w-j-1],j=1..w-1)) od;convert(a,list)end: A005159_list(19); # Peter Luschny, May 19 2011

InverseSeries[Series[y-3*y^2, {y, 0, 24}], x] (* then A(x)=y(x)/x *) (* Len Smiley, Apr 07 2000 *)
Table[3^n CatalanNumber[n],{n,0,30}] (* Harvey P. Dale, May 18 2011 *)
CoefficientList[Series[(1 - Sqrt[1-4*(3*x)])/(6*x), {x, 0, 50}], x] (* Stefano Spezia, Oct 16 2018 *)

a(n) = 3^n*binomial(2*n,n)/(n+1) \\ Charles R Greathouse IV, Feb 06 2017

G.f.: 2/(1+sqrt(1-12x)) = (1 - sqrt(1-4*(3*x))) / (6*x).
With offset 1 : a(1)=1, a(n) = 3*Sum_{i=1..n-1} a(i)*a(n-i). - Benoit Cloitre, Mar 16 2004
G.f.: c(3*x) with c(x) the o.g.f. of A000108 (Catalan).
From Gary W. Adamson, Jul 12 2011: (Start)
a(n) is the upper left term in M^n, M = the infinite square production matrix:
  3, 3, 0, 0, 0, 0, ...
  3, 3, 3, 0, 0, 0, ...
  3, 3, 3, 3, 0, 0, ...
  3, 3, 3, 3, 3, 0, ...
  3, 3, 3, 3, 3, 3, ...
  ... (End)
D-finite with recurrence (n+1)*a(n)+6*(1-2n)*a(n-1)=0. - R. J. Mathar, Apr 01 2012
E.g.f.: a(n) = n!* [x^n] KummerM(1/2, 2, 12*x). - Peter Luschny, Aug 25 2012
a(n) = sum_{k=0..n} A085880(n,k)*2^k. - Philippe Deléham, Nov 15 2013
From Ilya Gutkovskiy, Dec 04 2016: (Start)
E.g.f.: (BesselI(0,6*x) - BesselI(1,6*x))*exp(6*x).
a(n) ~ 12^n/(sqrt(Pi)*n^(3/2)). (End)
a(n) = A000244(n)*A000108(n). - Omar E. Pol, Mar 30 2018
Sum_{n>=0} 1/a(n) = 150/121 + 216*arctan(1/sqrt(11)) / (121*sqrt(11)). - Vaclav Kotesovec, Nov 23 2021
Sum_{n>=0} (-1)^n/a(n) = 138/169 - 216*arctanh(1/sqrt(13)) / (169*sqrt(13)). - Amiram Eldar, Jan 25 2022
G.f.: 1/(1-3*x/(1-3*x/(1-3*x/(1-3*x/(1-3*x/(1-3*x/(1-3*x/(1-3*x/(1-...))))))))) (continued fraction). - Nikolaos Pantelidis, Nov 20 2022

A151403 Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of 2*n steps taken from {(-1, 0), (-1, 1), (1, 0), (1, 1)}.

Original entry on oeis.org

1, 4, 32, 320, 3584, 43008, 540672, 7028736, 93716480, 1274544128, 17611882496, 246566354944, 3489862254592, 49855175065600, 717914520944640, 10409760553697280, 151860036312760320, 2227280532587151360, 32823081532863283200, 485781606686376591360, 7217326727911880785920

Offset: 0

Manuel Kauers, Nov 18 2008

Essentially the same as A052704. - R. J. Mathar, Nov 27 2008
From Joerg Arndt, Oct 22 2012: (Start)
Number of strings of length 2*n of four different types of balanced parentheses.
The number of strings of length 2*n of t different types of balanced parentheses is given by t^n * A000108(n): there are n opening parentheses in the strings, giving t^n choices for the type (the closing parentheses are chosen to match). (End)
Number of Dyck paths of length 2n in which the step U=(1,1) comes in 4 colors. - José Luis Ramírez Ramírez, Jan 31 2013

Richard P. Stanley, Catalan Numbers, Cambridge, 2015, p. 106.

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Mireille Bousquet-Mélou and Marni Mishna, Walks with small steps in the quarter plane, arXiv:0810.4387 [math.CO], 2008-2009.
Alon Regev, Enumerating Triangulations by Parallel Diagonals, Journal of Integer Sequences, Vol. 15 (2012), Article 12.8.5; arXiv preprint, arXiv:1208.3915 [math.CO], 2012.

Cf. A000108, A052704, A085880, A269796.

[4^n * Catalan(n): n in [0..20]]; // Vincenzo Librandi, Oct 24 2012

A151403_list := proc(n) local j, a, w; a := array(0..n); a[0] := 1;
for w from 1 to n do a[w] := 4*(a[w-1]+add(a[j]*a[w-j-1],j=1..w-1)) od; convert(a,list) end: A151403_list(20); # Peter Luschny, May 19 2011
seq(4^n*(2*n)!*coeff(series(hypergeom([],[2],x^2),x,2*n+2),x,2*n),n=0..20); # Peter Luschny, Jan 31 2015

aux[i_Integer, j_Integer, n_Integer] := Which[Min[i, j, n] < 0 || Max[i, j] > n, 0, n == 0, KroneckerDelta[i, j, n], True, aux[i, j, n] = aux[-1 + i, -1 + j, -1 + n] + aux[-1 + i, j, -1 + n] + aux[1 + i, -1 + j, -1 + n] + aux[1 + i, j, -1 + n]]; Table[Sum[aux[0, k, 2 n], {k, 0, 2 n}], {n, 0, 25}]

A151403 = lambda n: 4^n*hypergeometric([1-n,-n],[2],1)
[Integer(A151403(n).n()) for n in range(21)] # Peter Luschny, Sep 22 2014

a(n) = 4^n*A000108(n). - Philippe Deléham, Feb 01 2009
a(n) = Integral_{x=-2..2} (2*x)^(2*n)*sqrt((2-x)*(2+x))/(2*Pi) dx. - Peter Luschny, Sep 11 2011
E.g.f.: KummerM(1/2, 2, 16*x). - Peter Luschny, Aug 26 2012
G.f.: 2/(1 + sqrt(1-16*x)) = 1/U(0) where U(k) = 1 - 4*x/U(k+1); (continued fraction). - Sergei N. Gladkovskii, Oct 30 2012
G.f.: c(4*x) with c(x) the o.g.f. of A000108 (Catalan). - Philippe Deléham, Nov 15 2013
a(n) = sum{k=0..n} A085880(n,k)*3^k. - Philippe Deléham, Nov 15 2013
a(n) = 4^n*hypergeom([1-n,-n],[2],1). - Peter Luschny, Sep 22 2014
a(n) = 4^n*(2*n)!*[x^(2*n)]hypergeom([],[2],x^2). - Peter Luschny, Jan 31 2015
a(n) ~ 2^(4*n+2)/((2*n+1)*sqrt(Pi*(4*n+5))). - Peter Luschny, Jan 31 2015
D-finite with recurrence: (n+1)*a(n) +8*(-2*n+1)*a(n-1)=0. - R. J. Mathar, Feb 21 2020
Sum_{n>=0} 1/a(n) = 88/75 + 128*arctan(1/sqrt(15)) / (75*sqrt(15)). - Vaclav Kotesovec, Nov 23 2021
Sum_{n>=0} (-1)^n/a(n) = 248/289 - 384*arctanh(1/sqrt(17)) / (289*sqrt(17)). - Amiram Eldar, Jan 25 2022
G.f.: 1/(1-4*x/(1-4*x/(1-4*x/(1-4*x/(1-4*x/(1-4*x/(1-4*x/(1-4*x/(1-...)))))))))(continued fraction), cf. g.f. by Sergei N. Gladkovskii. - Nikolaos Pantelidis, Nov 21 2022
a(n) = 4*A269796(n-1) for n>0. - Hugo Pfoertner, Oct 04 2024

A052701 a(0) = 0; for n >= 1, a(n) = 2^(n-1)*C(n-1), where C(n) = A000108(n) Catalan numbers, n>0.

Original entry on oeis.org

0, 1, 2, 8, 40, 224, 1344, 8448, 54912, 366080, 2489344, 17199104, 120393728, 852017152, 6085836800, 43818024960, 317680680960, 2317200261120, 16992801914880, 125210119372800, 926554883358720, 6882979133521920

Offset: 0

encyclopedia(AT)pommard.inria.fr, Jan 25 2000

A151374 shifted one place right. - Joerg Arndt, Mar 17 2011
The number of rooted Eulerian n-edge maps in the plane (planar with a distinguished outside face). - Valery A. Liskovets, Mar 17 2005
This is also the number of strings of length 2n-2 of two different types of balanced parentheses. For example, a(2) = 2, since the two possible strings of length 2 are [] and (), a(3) = 8, since the 8 possible strings of length 4 are (()), [()], ([]), [[]], ()(), [](), ()[], and [][]. - Jeffrey Shallit, Jun 03 2006
Row sums of number triangle A110506. - Paul Barry, Jul 24 2005
Also row sums of triangle in A085880. - Philippe Deléham, Aug 01 2005
Row sums of number triangle A114608. - Philippe Deléham, Oct 15 2008

V. A. Liskovets and T. R. Walsh, Enumeration of unrooted maps on the plane, Rapport technique, UQAM, No. 2005-01, Montreal, Canada, 2005.

G. C. Greubel, Table of n, a(n) for n = 0..1000
Jean-Luc Baril, Sergey Kirgizov, and Mehdi Naima, A lattice on Dyck paths close to the Tamari lattice, arXiv:2309.00426 [math.CO], 2023.
M. Bousquet-Mélou, Limit laws for embedded trees, arXiv:math/0501266 [math.CO], 2005.
Marek Bożejko, Maciej Dołęga, Wiktor Ejsmont, and Światosław R. Gal, Reflection length with two parameters in the asymptotic representation theory of type B/C and applications, arXiv:2104.14530 [math.RT], 2021.
F. Chapoton and S. Giraudo, Enveloping operads and bicoloured noncrossing configurations, arXiv:1310.4521 [math.CO], 2013.
Ivan Geffner and Marc Noy, Counting Outerplanar Maps, Electronic Journal of Combinatorics, Vol. 24, No. 2 (2017), Article P2.3.
Aoife Hennessy, A Study of Riordan Arrays with Applications to Continued Fractions, Orthogonal Polynomials and Lattice Paths, Ph. D. Thesis, Waterford Institute of Technology, Oct. 2011.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 651.
V. A. Liskovets and T. R. Walsh, Counting unrooted maps on the plane, Advances in Applied Math., Vol. 36, No.4 (2006), pp. 364-387.
Vincent Pilaud and V. Pons, Permutrees, arXiv preprint arXiv:1606.09643 [math.CO], 2016-2017.
Index to sequences related to reversion of series.

Limit of array A102544.

Cf. A000108, A003645, A025225, A052714, A195699.

spec := [S,{B=Union(C,Z),S=Union(B,C),C=Prod(S,S)},unlabeled]: seq(combstruct[count](spec,size=n), n=0..20);

InverseSeries[Series[y-2*y^2, {y, 0, 24}], x] (* then A(x)=y(x) *) (* Len Smiley, Apr 07 2000 *)
Join[{0},Table[2^n CatalanNumber[n],{n,0,30}]] (* Harvey P. Dale, Aug 29 2015 *)

a(n)=if(n<1,0,2^(n-1)*(2*n-2)!/(n-1)!/n!)

a(n)=if(n<1,0,polcoeff(serreverse(x-2*x^2+x*O(x^n)),n))

a(n)=if(n<1,0,polcoeff(2*x/(1+sqrt(1-8*x+O(x^n))),n))

a(n) = A052714(n)/n!.
a(n) = A003645(n-2)*2, n>1.
a(n) = 8^(n-1)*GAMMA(n-1/2)/GAMMA(n+1)/Pi^(1/2), n>0.
D-finite with recurrence: a(1)=1, (-4+8*n)*a(n) - (n+1)*a(n+1) = 0.
G.f.: (1-sqrt(1-8*x))/4 = x*C(2*x) where C(x) is g.f. for Catalan numbers, A000108.
G.f. A(x) satisfies 2*A(x)^2-A(x)+x=0, A(0)=0 and A(x)=x+2*A(x)^2=x/(1-2*A(x)). Series reversion of x-2*x^2. - Michael Somos, Sep 06 2003
a(0)=0, a(1)=1; a(n) = 2*Sum_{i=1..n-1} a(i)*a(n-i). - Benoit Cloitre, Mar 16 2004
With a different offset, a(0)=1, a(n) = Sum_{k=0..n} Sum_{j=0..n} (j*C(2n-j-1, n-j)*C(j, k)*2^(n-j)/n), n>0. - Paul Barry, Jul 24 2005
The Hankel transform of a(n+1) = [1,2,8,40,224,1344,...] is 4^C(n+1,2). - Philippe Deléham, Nov 06 2007
G.f.: x + 4*x^2/(G(0)-4*x) where G(k) = k*(8*x+1) + 4*x + 2 - 2*x*(2*k+3)*(2*k+4)/G(k+1) ; (continued fraction ). - Sergei N. Gladkovskii, Apr 05 2013
a(n) ~ 8^(n-1)/(sqrt(Pi)*n^(3/2)). - Ilya Gutkovskiy, Dec 04 2016
From Amiram Eldar, Mar 06 2022: (Start)
Sum_{n>=1} 1/a(n) = 68/49 + 96*arcsin(sqrt(1/8))/(49*sqrt(7)).
Sum_{n>=1} (-1)^(n+1)/a(n) = 20/27 - 16*log(2)/81. (End)
a(n) = A025225(n)/2 for n>=1. - Alois P. Heinz, Feb 16 2025

Better description from Claude Lenormand (claude.lenormand(AT)free.fr), Mar 19 2001

Additional comments from Michael Somos, Feb 24 2002

A156058 a(n) = 5^n * Catalan(n).

Original entry on oeis.org

1, 5, 50, 625, 8750, 131250, 2062500, 33515625, 558593750, 9496093750, 164023437500, 2870410156250, 50784179687500, 906860351562500, 16323486328125000, 295863189697265625, 5395152282714843750, 98911125183105468750, 1822047042846679687500

Offset: 0

Philippe Deléham, Feb 03 2009

From Joerg Arndt, Oct 22 2012: (Start)
Number of strings of length 2*n of five different types of balanced parentheses.
The number of strings of length 2*n of t different types of balanced parentheses is given by t^n * A000108(n): there are n opening parentheses in the strings, giving t^n choices for the type (the closing parentheses are chosen to match). (End)
Number of Dyck paths of length 2n in which the step U=(1,1) come in 5 colors. [José Luis Ramírez Ramírez, Jan 31 2013]

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Cf. A000108, A005159, A085880, A151374, A151403.

[5^n*Catalan(n): n in [0..20]]; // Vincenzo Librandi, Jul 19 2011

A156058_list := proc(n) local j, a, w; a := array(0..n); a[0] := 1;
for w from 1 to n do a[w] := 5*(a[w-1]+add(a[j]*a[w-j-1],j=1..w-1)) od; convert(a,list)end: A156058_list(16); # Peter Luschny, May 19 2011
A156058 := proc(n)
    5^n*A000108(n) ;
end proc: # R. J. Mathar, Oct 06 2012

Table[5^n CatalanNumber[n],{n,0,20}]  (* Harvey P. Dale, Mar 13 2011 *)

a(n) = 5^n*A000108(n).
From Gary W. Adamson, Jul 18 2011: (Start)
a(n) is the upper left term in M^n, M = the infinite square production matrix:
  5, 5, 0, 0, 0, 0,...
  5, 5, 5, 0, 0, 0,...
  5, 5, 5, 5, 0, 0,...
  5, 5, 5, 5, 5, 0,...
  ... (End)
E.g.f.: KummerM(1/2, 2, 20*x). - Peter Luschny, Aug 26 2012
D-finite with recurrence (n+1)*a(n) -10*(2*n-1)*a(n-1)=0. - R. J. Mathar, Oct 06 2012
G.f.: c(5*x) with c(x) the o.g.f. of A000108 (Catalan). - Philippe Deléham, Nov 15 2013
a(n) = Sum_{k=0..n} A085880(n,k)*4^k. - Philippe Deléham, Nov 15 2013
G.f.: 1/(1 - 5*x/(1 - 5*x/(1 - 5*x/(1 - ...)))), a continued fraction. - Ilya Gutkovskiy, Apr 19 2017
Sum_{n>=0} 1/a(n) = 410/361 + 600*arctan(1/sqrt(19)) / (361*sqrt(19)). - Vaclav Kotesovec, Nov 23 2021
Sum_{n>=0} (-1)^n/a(n) = 130/147 - 200*arctanh(1/sqrt(21)) / (147*sqrt(21)). - Amiram Eldar, Jan 25 2022

A156128 a(n) = 6^n * Catalan(n).

Original entry on oeis.org

1, 6, 72, 1080, 18144, 326592, 6158592, 120092544, 2401850880, 48997757952, 1015589892096, 21327387734016, 452796847276032, 9702789584486400, 209580255024906240, 4558370546791710720, 99747873141559787520, 2194453209114315325440, 48508965675158549299200

Offset: 0

Philippe Deléham, Feb 04 2009

Number of Dyck n-paths with two types of up step and three types of down step. - David Scambler, Jun 21 2013

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Cf. A000108, A005159, A085880, A151374, A151403, A156058.

Column k=6 of A290605.

[6^n*Catalan(n): n in [0..20]]; // Vincenzo Librandi, Jul 19 2011

A156128_list := proc(n) local j, a, w; a := array(0..n); a[0] := 1;
for w from 1 to n do a[w] := 6*(a[w-1]+add(a[j]*a[w-j-1],j=1..w-1)) od;convert(a,list)end: A156128_list(16); # Peter Luschny, May 19 2011

Table[CatalanNumber[n]6^n, {n, 0, 16}] (* Alonso del Arte, Jul 19 2011 *)

a(n) = 6^n * A000108(n).
From Gary W. Adamson, Jul 18 2011: (Start)
a(n) is the upper left term in M^n, M = an infinite square production matrix:
  6, 6, 0, 0, 0, 0, ...
  6, 6, 6, 0, 0, 0, ...
  6, 6, 6, 6, 0, 0, ...
  6, 6, 6, 6, 6, 0, ...
  ... (End)
E.g.f.: KummerM(1/2, 2, 24*x). - Peter Luschny, Aug 26 2012
G.f.: c(6*x) with c(x) the o.g.f. of A000108 (Catalan). - Philippe Deléham, Nov 15 2013
a(n) = Sum{k=0..n} A085880(n,k) * 5^k. - Philippe Deléham, Nov 15 2013
G.f.: 1/(1 - 6*x/(1 - 6*x/(1 - 6*x/(1 - ...)))), a continued fraction. - Ilya Gutkovskiy, Aug 08 2017
Sum_{n>=0} 1/a(n) = 588/529 + 864*arctan(1/sqrt(23)) / (529*sqrt(23)). - Vaclav Kotesovec, Nov 23 2021
Sum_{n>=0} (-1)^n/a(n) = 564/625 - 432*log(3/2) / 3125. - Amiram Eldar, Jan 25 2022
D-finite with recurrence (n+1)*a(n) +12*(-2*n+1)*a(n-1)=0. - R. J. Mathar, Mar 21 2022

A156266 a(n) = 7^n*Catalan(n).

Original entry on oeis.org

1, 7, 98, 1715, 33614, 705894, 15529668, 353299947, 8243665430, 196199237234, 4744454282204, 116239129913998, 2879153833254412, 71978845831360300, 1813866914950279560, 46026872966863343835, 1175038992212864189670

Offset: 0

Philippe Deléham, Feb 07 2009

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Cf. A000108, A005159, A085880, A151374, A151403, A156058, A156128.

Column k=7 of A290605.

[7^n*Catalan(n): n in [0..20]]; // Vincenzo Librandi, Jul 19 2011

A156266_list := proc(n) local j, a, w; a := array(0..n); a[0] := 1;
for w from 1 to n do a[w] := 7*(a[w-1]+add(a[j]*a[w-j-1],j=1..w-1)) od;convert(a,list)end: A156266_list(16); # Peter Luschny, May 19 2011

Table[7^n * CatalanNumber[n], {n, 0, 16}] (* Amiram Eldar, Jan 25 2022 *)

a(n) = 7^n*A000108(n).
From Gary W. Adamson, Jul 18 2011: (Start)
a(n) is the upper left term in M^n, M = an infinite square production matrix:
  7, 7, 0, 0, 0, 0, ...
  7, 7, 7, 0, 0, 0, ...
  7, 7, 7, 7, 0, 0, ...
  7, 7, 7, 7, 7, 0, ...
  ... (End)
E.g.f.: KummerM(1/2, 2, 28*x). - Peter Luschny, Aug 26 2012
G.f.: c(7*x) with c(x) the o.g.f. of A000108 (Catalan). - Philippe Deléham, Nov 15 2013
a(n) = Sum_{k=0..n} A085880(n,k)*6^k. - Philippe Deléham, Nov 15 2013
G.f.: 1/(1 - 7*x/(1 - 7*x/(1 - 7*x/(1 - ...)))), a continued fraction. - Ilya Gutkovskiy, Aug 08 2017
Sum_{n>=0} 1/a(n) = 266/243 + 392*arctan(1/(3*sqrt(3))) / (729*sqrt(3)). - Vaclav Kotesovec, Nov 23 2021
Sum_{n>=0} (-1)^n/a(n) = 770/841 - 1176*arctanh(1/sqrt(29)) / (841*sqrt(29)). - Amiram Eldar, Jan 25 2022
D-finite with recurrence (n+1)*a(n) +14*(-2*n+1)*a(n-1)=0. - R. J. Mathar, Mar 21 2022

a(15) corrected by Vincenzo Librandi, Jul 19 2011

A156270 a(n) = 8^n*Catalan(n).

Original entry on oeis.org

1, 8, 128, 2560, 57344, 1376256, 34603008, 899678208, 23991418880, 652566593536, 18034567675904, 504967894925312, 14294475794808832, 408413594137395200, 11762311511156981760, 341107033823552471040, 9952299339793060331520

Offset: 0

Philippe Deléham, Feb 07 2009

A quarter of the count of And/Or-Trees with 2 variables [Chauvin]. - R. J. Mathar, Apr 01 2012

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Brigitte Chauvin, Philippe Flajolet, Daniele Gardy and Bernhard Gittenberger, And/Or Tree Revisited, Combinat., Probal. Comput., Vol. 13, No. 4-5 (2004), pp. 475-497.

Cf. A000108, A005159, A085880, A151374, A151403, A156058, A156128, A156266.

Column k=8 of A290605.

[8^n*Catalan(n): n in [0..20]]; // Vincenzo Librandi, Jul 19 2011

Table[8^n*CatalanNumber[n], {n, 0, 20}] (* Wesley Ivan Hurt, Dec 28 2013 *)

a(n) = 8^n*A000108(n).
From Gary W. Adamson, Jul 18 2011: (Start)
a(n) is the upper left term in M^n, M = an infinite square production matrix:
  8, 8, 0, 0, 0, 0, ...
  8, 8, 8, 0, 0, 0, ...
  8, 8, 8, 8, 0, 0, ...
  8, 8, 8, 8, 8, 0, ...
  ... (End)
E.g.f.: KummerM(1/2, 2, 32*x). - Peter Luschny, Aug 26 2012
G.f.: c(8*x) with c(x) the o.g.f. of A000108 (Catalan). - Philippe Deléham, Nov 15 2013
a(n) = Sum_{k=0..n} A085880(n,k)*7^k. - Philippe Deléham, Nov 15 2013
G.f.: 1/(1 - 8*x/(1 - 8*x/(1 - 8*x/(1 - ...)))), a continued fraction. - Ilya Gutkovskiy, Aug 08 2017
(n+1)*a(n) +16*(-2*n+1)*a(n-1)=0. - R. J. Mathar, Apr 14 2018
Sum_{n>=0} 1/a(n) = 1040/961 + 1536*arctan(1/sqrt(31)) / (961*sqrt(31)). - Vaclav Kotesovec, Nov 23 2021
Sum_{n>=0} (-1)^n/a(n) = 112/121 - 512*arctanh(1/sqrt(33)) / (363*sqrt(33)). - Amiram Eldar, Jan 25 2022
D-finite with recurrence +(n+1)*a(n) +16*(-2*n+1)*a(n-1)=0. - R. J. Mathar, Mar 21 2022

A156273 a(n) = 9^n*Catalan(n).

Original entry on oeis.org

1, 9, 162, 3645, 91854, 2480058, 70150212, 2051893701, 61556811030, 1883638417518, 58564030799196, 1844766970174674, 58748732742485772, 1888352123865614100, 61182608813245896840, 1996082612532147384405, 65518476340761072970470, 2162109719245115408025510

Offset: 0

Philippe Deléham, Feb 07 2009

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Cf. A000108, A005159, A085880, A151374, A151403, A156058, A156128, A156266, A156270.

Column k=9 of A290605.

[9^n*Catalan(n): n in [0..20]]; // Vincenzo Librandi, Jul 19 2011

Table[9^n CatalanNumber[n],{n,0,20}] (* Harvey P. Dale, Sep 09 2012 *)

a(n) = 9^n*A000108(n).
From Gary W. Adamson, Jul 18 2011: (Start)
a(n) is the upper left term in M^n, M = an infinite square production matrix:
  9, 9, 0, 0, 0, 0, ...
  9, 9, 9, 0, 0, 0, ...
  9, 9, 9, 9, 0, 0, ...
  9, 9, 9, 9, 9, 0, ...
  ... (End)
E.g.f.: KummerM(1/2, 2, 36*x). - Peter Luschny, Aug 26 2012
G.f.: c(9*x) with c(x) the o.g.f. of A000108 (Catalan). - Philippe Deléham, Nov 15 2013
a(n) = Sum{k=0..n} A085880(n,k)*8^k. - Philippe Deléham, Nov 15 2013
G.f.: 1/(1 - 9*x/(1 - 9*x/(1 - 9*x/(1 - ...)))), a continued fraction. - Ilya Gutkovskiy, Aug 08 2017
Sum_{n>=0} 1/a(n) = 1314/1225 + 1944*arctan(1/sqrt(35)) / (1225*sqrt(35)). - Vaclav Kotesovec, Nov 23 2021
Sum_{n>=0} (-1)^n/a(n) = 1278/1369 - 1944*arctanh(1/sqrt(37)) / (1369*sqrt(37)). - Amiram Eldar, Jan 25 2022
D-finite with recurrence (n+1)*a(n) +18*(-2*n+1)*a(n-1)=0. - R. J. Mathar, Mar 21 2022

cp's OEIS Frontend

A052709 Expansion of g.f. (1-sqrt(1-4*x-4*x^2))/(2*(1+x)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

SageMath

Formula

Extensions

A151374 Number of walks within N^2 (the first quadrant of Z^2) starting at (0, 0), ending on the vertical axis and consisting of 2n steps taken from {(-1, -1), (-1, 0), (1, 1)}.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A005159 a(n) = 3^n*Catalan(n).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Formula

A151403 Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of 2*n steps taken from {(-1, 0), (-1, 1), (1, 0), (1, 1)}.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Sage

Formula

A052701 a(0) = 0; for n >= 1, a(n) = 2^(n-1)*C(n-1), where C(n) = A000108(n) Catalan numbers, n>0.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

PARI

Formula

Extensions

A156058 a(n) = 5^n * Catalan(n).

Views

Author

Keywords

Comments

A052709 Expansion of g.f. (1-sqrt(1-4x-4x^2))/(2*(1+x)).