Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145895
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A145895 Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having k UDU and DUD's (here U=(1,1), D=(1,-1); 0<=k<=2n-2). +0
1
1, 1, 0, 1, 1, 2, 1, 0, 1, 2, 4, 2, 4, 1, 0, 1, 4, 8, 10, 8, 4, 6, 1, 0, 1, 8, 20, 26, 24, 25, 12, 7, 8, 1, 0, 1, 17, 48, 70, 84, 70, 54, 47, 16, 11, 10, 1, 0, 1, 37, 116, 197, 244, 241, 224, 141, 104, 76, 20, 16, 12, 1, 0, 1, 82, 286, 535, 728, 816, 734, 609, 472, 246, 180, 112, 24, 22 (list; graph; listen)
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 December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research