Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096794
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096794 Triangle read by rows: a(n,k) = number of Dyck n-paths such that number of DUs at level 1 plus number of UDs at level 2 is k, 0<=k<=n-1. +0
1
1, 0, 2, 1, 0, 4, 2, 4, 0, 8, 6, 8, 12, 0, 16, 18, 26, 24, 32, 0, 32, 57, 80, 84, 64, 80, 0, 64, 186, 260, 264, 240, 160, 192, 0, 128, 622, 864, 880, 768, 640, 384, 448, 0, 256, 2120, 2932, 2976, 2624, 2080, 1632, 896, 1024, 0, 512, 7338, 10112, 10248, 9024, 7280 (list; table; graph; listen)
OFFSET

1,3

COMMENT

Column k has g.f. F(x)^(k+1)*(2y)^k where F(x)=(1-sqrt(1-4*x))/(3-sqrt(1-4*x)) is the g.f. for Fine's sequence A000957.

FORMULA

G.f. (1 - (1 - 4*x)^(1/2))/(3 - 2y + (2y-1)(1 - 4*x)^(1/2) ) = Sum_{n>=1, k>=0} a(n, k) x^n y^k.

EXAMPLE

Table begins

\ k 0, 1, 2, ...

n

1 | 1

2 | 0, 2

3 | 1, 0, 4

4 | 2, 4, 0, 8

5 | 6, 8, 12, 0, 16

6 | 18, 26, 24, 32, 0, 32

7 | 57, 80, 84, 64, 80, 0, 64

a(4,1) = 4 because UudUUDDD, UUUDDudD, UduUUDDD, UUUDDduD each contain one

relevant turn (in small type).

CROSSREFS

Row sums are the Catalan numbers A000108.

Sequence in context: A004558 A129699 A002349 this_sequence A106375 A131667 A086802

Adjacent sequences: A096791 A096792 A096793 this_sequence A096795 A096796 A096797

KEYWORD

nonn,tabl

AUTHOR

David Callan (callan(AT)stat.wisc.edu), Aug 17 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research