A026671 Number of lattice paths from (0,0) to (n,n) with steps (0,1), (1,0) and, when on the diagonal, (1,1).

1, 3, 11, 43, 173, 707, 2917, 12111, 50503, 211263, 885831, 3720995, 15652239, 65913927, 277822147, 1171853635, 4945846997, 20884526283, 88224662549, 372827899079, 1576001732485, 6663706588179, 28181895551161, 119208323665543, 504329070986033, 2133944799315027

Offset

0,2

Comments

1, 1, 3, 11, 43, 173, ... is the unique sequence for which both the Hankel transform of the sequence itself and the Hankel transform of its left shift are the powers of 2 (A000079). For example, det[{{1, 1, 3}, {1, 3, 11}, {3, 11, 43}}] = det[{{1, 3, 11}, {3, 11, 43}, {11, 43, 173}}] = 4. - David Callan, Mar 30 2007

From Paul Barry, Jan 25 2009: (Start)

a(n) is the image of F(2n+2) under the Catalan matrix (1,xc(x)) where c(x) is the g.f. of A000108.

The sequence 1,1,3,... is the image of A001519 under (1,xc(x)). This sequence has g.f. given by 1/(1-x-2x^2/(1-3x-x^2/(1-2x-x^2/(1-2x-x^2/(1-... (continued fraction). (End)

Binomial transform of A111961. - Philippe Deléham, Feb 11 2009

From Paul Barry, Nov 03 2010: (Start)

The sequence 1,1,3,... has g.f. 1/(1-x/sqrt(1-4x)), INVERT transform of A000984.

It is an eigensequence of the sequence array for A000984. (End)

References

L. W. Shapiro and C. J. Wang, Generating identities via 2 X 2 matrices, Congressus Numerantium, 205 (2010), 33-46.

Links

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

Jean-Christophe Aval, Adrien Boussicault and Sandrine Dasse-Hartaut, The tree structure in staircase tableaux, arXiv:1109.4907 [math.CO], 2011-2013.

Cyril Banderier, Markus Kuba, and Michael Wallner, Analytic Combinatorics of Composition schemes and phase transitions with mixed Poisson distributions, arXiv:2103.03751 [math.PR], 2021.

Miklos Bona, The permutation classes equinumerous to the smooth class, Electron. J. Combin., 5 (1998), no. 1, Research Paper 31, 12 pp.

David Callan and Toufik Mansour, Five subsets of permutations enumerated as weak sorting permutations, arXiv:1602.05182 [math.CO], 2016.

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.

Milan Janjić, Pascal Matrices and Restricted Words, J. Int. Seq., Vol. 21 (2018), Article 18.5.2.

J. W. Layman, The Hankel Transform and Some of its Properties, J. Integer Sequences, 4 (2001), #01.1.5.

Huyile Liang, Jeffrey Remmel and Sainan Zheng, Stieltjes moment sequences of polynomials, arXiv:1710.05795 [math.CO], 2017, see page 16.

Formula

From Wolfdieter Lang, Mar 21 2000: (Start)

G.f.: 1/(sqrt(1-4*x)-x).

a(n) = Sum_{i=1..n} a(i-1)*binomial(2*(n-i), n-i) + binomial(2*n, n), n >= 1, a(0)=1. (End)

G.f.: 1/(1 -x -2*x*c(x)) where c(x) = g.f. for Catalan numbers A000108. - Michael Somos, Apr 20 2007

From Paul Barry, Jan 25 2009: (Start)

G.f.: 1/(1 - 3xc(x) + x^2*c(x)^2);

G.f.: 1/(1-3x-2x^2/(1-2x-x^2/(1-2x-x^2/(1-2x-x^2/(1-... (continued fraction).

a(0) = 1, a(n) = Sum_{k=0..n} (k/(2n-k))*C(2n-k,n-k)*F(2k+2). (End)

a(n) = Sum_{k=0..n} A039599(n,k)*A000045(k+2). - Philippe Deléham, Feb 11 2009

From Paul Barry, Feb 08 2009: (Start)

G.f.: 1/(1-x/(1-2x/(1-x/(1-x/(1-x/(1-x/(1-x/(1-... (continued fraction);

G.f. of 1,1,3,... is 1/(1-x-2x/(1-x/(1-x/(1-x/(1-... (continued fraction). (End)

From Gary W. Adamson, Jul 14 2011: (Start)

a(n) = the upper left term in M^n, M = the infinite square production matrix:

3, 2, 0, 0, 0, 0, ...

1, 1, 1, 0, 0, 0, ...

1, 1, 1, 1, 0, 0, ...

1, 1, 1, 1, 1, 0, ...

1, 1, 1, 1, 1, 1, ...

...

(End)

D-finite with recurrence: n*a(n) = 2*(4*n-3)*a(n-1) - 3*(5*n-8)*a(n-2) - 2*(2*n-3)*a(n-3). - Vaclav Kotesovec, Oct 08 2012

a(n) ~ (2+sqrt(5))^n/sqrt(5). - Vaclav Kotesovec, Oct 08 2012

Mathematica

Table[SeriesCoefficient[1/(Sqrt[1-4*x]-x), {x, 0, n}], {n, 0, 30}] (* Vaclav Kotesovec, Oct 08 2012 *)

Prog

(PARI) {a(n)= if(n<0, 0, polcoeff( 1/(sqrt(1 -4*x +x*O(x^n)) -x), n))} /* Michael Somos, Apr 20 2007 */
(PARI) x='x+O('x^66); Vec( 1/(sqrt(1-4*x)-x) ) \\ Joerg Arndt, May 04 2013
(Magma) R<x>:=PowerSeriesRing(Rationals(), 30); Coefficients(R!( 1/(Sqrt(1-4*x)-x) )); // G. C. Greubel, Jul 16 2019
(Sage) (1/(sqrt(1-4*x)-x)).series(x, 30).coefficients(x, sparse=False) # G. C. Greubel, Jul 16 2019
(GAP) a:=[3, 11, 43];; for n in [4..30] do a[n]:=(2*(4*n-3)*a[n-1] - 3*(5*n-8)*a[n-2] - 2*(2*n-3)*a[n-3])/n; od; Concatenation([1], a); # G. C. Greubel, Jul 16 2019

Crossrefs

a(n)=T(2n-1,n-1), T given by A026736, a(n)=T(2n,n), T given by A026670, a(n)=T(2n+1,n+1), T given by A026725. Row sums of triangle A054335.

Cf. A026781.

Sequence in context: A302705 A007583 A356281 * A026876 A270447 A151090

Adjacent sequences: A026668 A026669 A026670 * A026672 A026673 A026674

Keyword

nonn,easy

Author

Clark Kimberling, Miklos Bona

Status

approved