A171128 -id:A171128 - cp's OEIS frontend

A109187 Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k (1,0)-steps.

1, 0, 1, 2, 0, 1, 0, 6, 0, 1, 6, 0, 12, 0, 1, 0, 30, 0, 20, 0, 1, 20, 0, 90, 0, 30, 0, 1, 0, 140, 0, 210, 0, 42, 0, 1, 70, 0, 560, 0, 420, 0, 56, 0, 1, 0, 630, 0, 1680, 0, 756, 0, 72, 0, 1, 252, 0, 3150, 0, 4200, 0, 1260, 0, 90, 0, 1, 0, 2772, 0, 11550, 0, 9240, 0, 1980, 0, 110, 0, 1

Offset: 0

Emeric Deutsch, Jun 21 2005

A Grand Motzkin path is a path in the half-plane x >= 0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).
From Peter Bala, Feb 11 2017: (Start)
Consider an infinite 1-dimensional integer lattice with an oriented self-loop at each vertex. Then T(n,k) equals the number of walks of length n from a vertex to itself having k loops. There is a bijection between such walks and Grand Motzkin paths which takes a right step and a left step on the lattice to an up step U and a down step D of a Grand Motzkin path respectively, and takes traversing a loop on the lattice to the horizontal step H. See A282252 for the corresponding triangle of walks on a 2-dimensional lattice with self-loops. (End)

			T(3,1)=6 because we have hud,hdu,udh,duh,uhd,dhu, where u=(1,1),d=(1,-1), h=(1,0).
Triangle begins:
n\k   [0]  [1]   [2]   [3]   [4]   [5]   [6]  [7]  [8]  [9] [10]
[0]    1;
[1]    0,   1;
[2]    2,   0,    1;
[3]    0,   6,    0,    1;
[4]    6,   0,   12,    0,    1;
[5]    0,  30,    0,   20,    0,    1;
[6]   20,   0,   90,    0,   30,    0,    1;
[7]    0, 140,    0,  210,    0,   42,    0,   1;
[8]   70,   0,  560,    0,  420,    0,   56,   0,   1;
[9]    0, 630,    0, 1680,    0,  756,    0,  72,   0,   1;
[10] 252,   0, 3150,    0, 4200,    0, 1260,   0,  90,   0,   1;
[11] ...
From _Peter Bala_, Feb 11 2017: (Start)
The infinitesimal generator begins
      0
      0    0
      2    0     0
      0    6     0     0
     -6    0    12     0     0
      0  -30     0    20     0   0
     80    0   -90     0    30   0   0
      0  560     0  -210     0  42   0  0
  -2310    0  2240     0  -420   0  56  0  0
  ....
and equals the generalized exponential Riordan array [log(Bessel_I(0,2x)),x], and so has integer entries. (End)

Gheorghe Coserea, Rows n = 0..100, flattened
Paul Barry, On the duals of the Fibonacci and Catalan-Fibonacci polynomials and Motzkin paths, arXiv:2101.10218 [math.CO], 2021.

Diagonal of rational function R(x, y, t) = 1/(1 - (x^2 + t*x*y + y^2)) with respect to x,y, i.e., T(n,k) = [(xy)^n*t^k] R(x,y,t). For t=0..7 we have the diagonals: A126869(t=0, column 0), A002426(t=1, row sums), A000984(t=2), A026375(t=3), A081671(t=4), A098409(t=5), A098410(t=6), A104454(t=7).

Cf. A089627, A109188, A105868, A171128, A108666, A282252, A298608.

G:=1/sqrt((1-t*z)^2-4*z^2):Gser:=simplify(series(G,z=0,15)): P[0]:=1: for n from 1 to 13 do P[n]:=coeff(Gser,z^n) od: for n from 0 to 13 do seq(coeff(t*P[n],t^k),k=1..n+1) od;
with(PolynomialTools): CL := p -> CoefficientList(simplify(p), x):
C := (n,x) -> binomial(2*n,n)*hypergeom([-n,-n],[-n+1/2],1/2-x/4):
seq(print(CL(C(n,x))), n=0..11); # Peter Luschny, Jan 23 2018

p[0] := 1; p[n_] := GegenbauerC[n, -n , -x/2];
Flatten[Table[CoefficientList[p[n], x], {n, 0, 11}]] (* Peter Luschny, Jan 23 2018 *)

T(n,k) = if ((n-k)%2, 0, binomial(n,k)*binomial(n-k, (n-k)/2));
concat(vector(12, n, vector(n, k, T(n-1, k-1)))) \\ Gheorghe Coserea, Sep 06 2018

G.f.: 1/sqrt((1-tz)^2-4z^2).
Row sums yield the central trinomial coefficients (A002426).
T(2n+1, 0) = 0.
T(2n, 0) = binomial(2n,n) (A000984).
Sum_{k=0..n} k*T(n,k) = A109188(n).
Except for the order, same rows as those of A105868.
Column k has e.g.f. (x^k/k!)*Bessel_I(0,2x). - Paul Barry, Mar 11 2006
T(n,k) = binomial((n+k)/2,k)*binomial(n,(n+k)/2)*(1+(-1)^(n-k))/2. - Paul Barry, Sep 18 2007
Coefficient array of the polynomials P(n,x) = x^n*hypergeom([1/2-n/2,-n/2], [1], 4/x^2). - Paul Barry, Oct 04 2008
G.f.: 1/(1-xy-2x^2/(1-xy-x^2/(1-xy-x^2/(1-xy-x^2/(1-.... (continued fraction). - Paul Barry, Jan 28 2009
From Paul Barry, Apr 21 2010: (Start)
Exponential Riordan array [Bessel_I(0,2x), x].
Coefficient array of the polynomials P(n,x) = Sum_{k=0..floor(n/2)} C(n,2k)*C(2k, k)*x^(n - 2k).
Diagonal sums are the aerated central Delannoy numbers (A001850 with interpolated zeros). (End)
From Peter Bala, Feb 11 2017: (Start)
T(n,k) = binomial(n,k)*binomial(n-k,floor((n-k)/2))*(1 + (-1)^(n-k))/2.
T(n,k) = (n/k) * T(n-1,k-1).
T(n,k) = the coefficient of H^k in the expansion of (H + U + 1/U)^n.
n-th row polynomial R(n,t) = Sum_{k = 0..floor(n/2)} binomial(n,2*k) * binomial(2*k,k) * t^(n-2*k) = coefficient of x^n in the expansion of (1 + t*x + x^2)^n.
R(n,t) = Sum_{k = 0..n} binomial(n,k)*binomial(2*k,k)*(t - 2)^(n-k).
d/dt(R(n,t)) = n*R(n-1,t).
R(n,t) = (1/Pi) * Integral_{x = 0..Pi} (t + 2*cos(x))^n dx.
Moment representation on a finite interval: R(n,t) = 1/Pi * Integral_{x = t-2 .. t+2} x^n/sqrt((t + 2 - x)*(x - t + 2)) dx.
Recurrence: n*R(n,t) = t*(2*n - 1)*R(n-1,t) - (t^2 - 4)*(n - 1)*R(n-2,t) with R(0,t) = 1 and R(1,t) = t.
R(n,t) = A002426 (t = 1), A000984 (t = 2), A026375 (t = 3), A081671 (t = 4), A098409 (t = 5), A098410 (t = 6) and A104454(t = 7).
The zeros of the row polynomials appear to lie on the imaginary axis in the complex plane. Also, the zeros of R(n,t) and R(n+1,t) appear to interlace on the imaginary axis.
The polynomials R(n,1 + t) are the row polynomials of A171128. (End)
From Peter Luschny, Jan 23 2018: (Start)
These are the coefficients of the polynomials G(n, -n , -x/2) where G(n, a, x) denotes the n-th Gegenbauer polynomial.
These polynomials can also be expressed as C(n, x) = binomial(2*n,n)*hypergeom([-n, -n], [-n+1/2], 1/2-x/4). (End)

A098473 Triangle T(n,k) read by rows, T(n, k) = binomial(2k, k)binomial(n, k), 0<=k<=n.

Original entry on oeis.org

1, 1, 2, 1, 4, 6, 1, 6, 18, 20, 1, 8, 36, 80, 70, 1, 10, 60, 200, 350, 252, 1, 12, 90, 400, 1050, 1512, 924, 1, 14, 126, 700, 2450, 5292, 6468, 3432, 1, 16, 168, 1120, 4900, 14112, 25872, 27456, 12870, 1, 18, 216, 1680, 8820, 31752, 77616, 123552, 115830

Offset: 0

Paul Barry, Sep 09 2004

This sequence gives the coefficients of the Jensen polynomials (increasing powers of x) of degree n and shift 0 for the central binomial sequence A000984. For a definition of Jensen polynomials see a comment in A094436. - Wolfdieter Lang, Jun 25 2019

			Rows begin
  1;
  1,  2;
  1,  4,  6;
  1,  6, 18,  20;
  1,  8, 36,  80,  70;
  1, 10, 60, 200, 350, 252;

Indranil Ghosh, Rows 0..125, flattened
O. T. Dasbach, A natural series for the natural logarithm, Electronic Journal of Combinatorics, (15) 2008 #N5.

Row sums are A026375.
Antidiagonal sums are A026569.
Principal diagonal is A000984.
Cf. A002426, A081671, A098409, A098410, A094436, A126869.

A098473 := proc(n,k) binomial(2*k,k)*binomial(n,k) ; end proc:

Table[Binomial[2k,k]Binomial[n,k],{n,0,10},{k,0,n}]//Flatten (* Harvey P. Dale, Aug 15 2020 *)

T(n,k)=binomial(2*k, k)*binomial(n, k);
for(n=0,10,for(k=0,n,print1(T(n,k),", "));print()); /* as triangle */

T(n, k) = binomial(2*k, k)*binomial(n, k).
Sum_{k=0..n} T(n,k)*x^(n-k) = A126869(n), A002426(n), A000984(n), A026375(n), A081671(n), A098409(n), A098410(n) for x = -2, -1, 0, 1, 2, 3, 4 respectively. - Philippe Deléham, Sep 28 2007
From Peter Bala, Jun 06 2011: (Start)
O.g.f.: 1/sqrt(1 - t)*1/sqrt(1 - t*(1 + 4*x)) = 1 + (2*x + 1)*t + (1 + 4*x + 6*x^2)*t^2 + ....
Let R_n(x) denote the row generating polynomials of this triangle, which begin
R_1(x) = 1 + 2*x, R_2(x) = 1 + 4*x + 6*x^2, R_3(x) = 1 + 6*x + 18*x^2 + 20*x^3.
Dasbach gives the following slowly converging series for the logarithm function:
log(x)  = Sum_{n >= 1} 1/n*R_n(-1/x), valid for x >= 4.
The polynomials (1 - x)^n*R_n(x/(1 - x)) appear to be the row polynomials of A135091 (see also A171128). (End)

A211357 Triangle read by rows: T(n,k) is the number of noncrossing partitions up to rotation of an n-set that contain k singleton blocks.

Original entry on oeis.org

1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 2, 0, 1, 2, 3, 2, 2, 0, 1, 5, 6, 9, 4, 3, 0, 1, 6, 15, 18, 15, 5, 3, 0, 1, 15, 36, 56, 42, 29, 7, 4, 0, 1, 28, 91, 144, 142, 84, 42, 10, 4, 0, 1, 67, 232, 419, 432, 322, 152, 66, 12, 5, 0, 1, 145, 603, 1160, 1365, 1080, 630, 252, 90, 15, 5, 0, 1

Offset: 0

Tilman Piesk, Apr 12 2012

			From _Andrew Howroyd_, Nov 16 2017: (Start)
Triangle begins: (n >= 0, 0 <= k <= n)
   1;
   0,   1;
   1,   0,   1;
   1,   1,   0,   1;
   2,   1,   2,   0,   1;
   2,   3,   2,   2,   0,   1;
   5,   6,   9,   4,   3,   0,  1;
   6,  15,  18,  15,   5,   3,  0,  1;
  15,  36,  56,  42,  29,   7,  4,  0, 1;
  28,  91, 144, 142,  84,  42, 10,  4, 0, 1;
  67, 232, 419, 432, 322, 152, 66, 12, 5, 0, 1;
(End)

Andrew Howroyd, Table of n, a(n) for n = 0..1274 (terms 0..90 from Tilman Piesk)

Column k=0 is A295198.
Row sums are A054357.
Cf. A091867 (noncrossing partitions of an n-set with k singleton blocks), A211359 (up to rotations and reflections).
Cf. A171128.

a91867[n_, k_] := If[k == n, 1, (Binomial[n + 1, k]/(n + 1)) Sum[Binomial[n + 1 - k, j] Binomial[n - k - j - 1, j - 1], {j, 1, (n - k)/2}]];
a2426[n_] := Sum[Binomial[n, 2*k]*Binomial[2*k, k], {k, 0, Floor[n/2]}];
a171128[n_, k_] := Binomial[n, k]*a2426[n - k];
T[0, 0] = 1;
T[n_, k_] := (1/n)*(a91867[n, k] - a171128[n, k] + Sum[EulerPhi[d]* a171128[n/d, k/d], {d, Divisors[GCD[n, k]]}]);
Table[T[n, k], {n, 0, 11}, {k, 0, n}] // Flatten (* Jean-François Alcover, Jul 03 2018, after Andrew Howroyd *)

g(x,y) = {1/sqrt((1 - (1 + y)*x)^2 - 4*x^2) - 1}
S(n)={my(A=(1-sqrt(1-4*x/(1-(y-1)*x) + O(x^(n+2))))/(2*x)-1); Vec(1+intformal((A + sum(k=2, n, eulerphi(k)*g(x^k + O(x*x^n), y^k)))/x))}
my(v=S(10)); for(n=1, #v, my(p=v[n]); for(k=0, n-1, print1(polcoeff(p,k), ", ")); print) \\ Andrew Howroyd, Nov 16 2017

T(n,k) = (1/n)*(A091867(n,k) - A171128(n,k) + Sum_{d|gcd(n,k)} phi(d) * A171128(n/d, k/d)) for n > 0. - Andrew Howroyd, Nov 16 2017

cp's OEIS Frontend

A109187 Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k (1,0)-steps.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A098473 Triangle T(n,k) read by rows, T(n, k) = binomial(2k, k)binomial(n, k), 0<=k<=n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A211357 Triangle read by rows: T(n,k) is the number of noncrossing partitions up to rotation of an n-set that contain k singleton blocks.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

cp's OEIS Frontend

A109187 Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k (1,0)-steps.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A098473 Triangle T(n,k) read by rows, T(n, k) = binomial(2*k, k)*binomial(n, k), 0<=k<=n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A211357 Triangle read by rows: T(n,k) is the number of noncrossing partitions up to rotation of an n-set that contain k singleton blocks.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A098473 Triangle T(n,k) read by rows, T(n, k) = binomial(2k, k)binomial(n, k), 0<=k<=n.