The On-Line Encyclopedia of Integer Sequences (OEIS)

A110446 revision #1

A110446

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

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

(list; table; graph; refs; listen; history; text; internal format)

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.

LINKS

Table of n, a(n) for n=0..50.

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....

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.

Sequence in context: A110107 A154537 A201641 * A109979 A110171 A104988

Adjacent sequences: A110443 A110444 A110445 * A110447 A110448 A110449

KEYWORD

nonn,tabl,new

AUTHOR

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

STATUS

approved