

A263216


Triangle read by rows: T(n>=2, k>=1) is the number of Dyck paths of length 2n that correspond to k alternating sign matrices.


0



2, 3, 2, 5, 4, 0, 0, 3, 0, 2, 8, 10, 0, 0, 6, 0, 4, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 2, 13, 20, 0, 4, 15, 0, 10, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

2,1


COMMENTS



LINKS



EXAMPLE

Triangle begins:
2,
3,2,
5,4,0,0,3,0,2,
8,10,0,0,6,0,4,0,0,0,0,0,0,5,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,2,
...


CROSSREFS



KEYWORD

nonn,tabf


AUTHOR



STATUS

approved



