[go: up one dir, main page]

login
Revision History for A110446 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Triangle of Delannoy paths counted by number of diagonal steps not preceded by an east step.
(history; published version)
#7 by Vaclav Kotesovec at Sat Oct 08 03:20:33 EDT 2016
STATUS

proposed

approved

#6 by Jean-François Alcover at Sat Oct 08 02:57:53 EDT 2016
STATUS

editing

proposed

#5 by Jean-François Alcover at Sat Oct 08 02:57:47 EDT 2016
MATHEMATICA

T[n_, k_] := SeriesCoefficient[(1-z(4 + 2*t) - z^2 (4 - 4*t - t^2))^(-1/2), {z, 0, n}, {t, 0, k}]; Table[T[n, k], {n, 0, 9}, {k, 0, n}] // Flatten (* Jean-François Alcover, Oct 08 2016 *)

STATUS

approved

editing

#4 by Russ Cox at Sat Mar 31 10:22:43 EDT 2012
AUTHOR

_David Callan (callan(AT)stat.wisc.edu), _, Jul 20 2005

Discussion
Sat Mar 31
10:22
OEIS Server: https://oeis.org/edit/global/348
#3 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009
FORMULA

GfG.f. G(z, t)=Sum_{n>=k>=0}T(n, k)*z^n*t^k is given by G(z, t)= (1 - z(4 + 2*t) - z^2(4 - 4*t - t^2))^(-1/2)

KEYWORD

nonn,tabl,new

#2 by N. J. A. Sloane at Fri Feb 24 03:00:00 EST 2006
FORMULA

Gf. G(z, t)=Sum_{n>=k>=0}T(n, k)*z^n*t^k is given by G(z, t)= (1 - z(4 + 2*t) - z^2(4 - 4*t - t^2))^(-1/2)

KEYWORD

nonn,tabl,new

#1 by N. J. A. Sloane at Wed Sep 21 03:00:00 EDT 2005
NAME

Triangle of Delannoy paths counted by number of diagonal steps not preceded by an east step.

DATA

1, 2, 1, 8, 4, 1, 32, 24, 6, 1, 136, 128, 48, 8, 1, 592, 680, 320, 80, 10, 1, 2624, 3552, 2040, 640, 120, 12, 1, 11776, 18368, 12432, 4760, 1120, 168, 14, 1, 53344, 94208, 73472, 33152, 9520, 1792, 224, 16, 1, 243392, 480096, 423936, 220416, 74592, 17136

OFFSET

0,2

COMMENTS

T(n,k) = number of Delannoy paths (A001850) of steps east(E), north(N) and diagonal (D) (i.e., northeast) from (0,0) to (n,n) containing k Ds not preceded by an E.

FORMULA

Gf. G(z,t)=Sum_{n>=k>=0}T(n,k)*z^n*t^k is given by G(z,t)= (1 - z(4 + 2*t) - z^2(4 - 4*t - t^2))^(-1/2)

EXAMPLE

Table begins

\ k...0....1....2....3....4....

n\

0 |...1

1 |...2....1

2 |...8....4....1

3 |..32...24....6....1

4 |.136..128...48....8....1

5 |.592..680..320...80...10....1

The paths ENDD, NDDE, DEND, DNDE, DDEN, DDNE each have 2 Ds not preceded by an E,

and so T(3,2)=6.

CROSSREFS

Column k=0 is A006139.

KEYWORD

nonn,tabl

AUTHOR

David Callan (callan(AT)stat.wisc.edu), Jul 20 2005

STATUS

approved