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.

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

Offset

2,1

Comments

Row sums give A000108, n >= 2.

Links

Table of n, a(n) for n=2..101.

FindStat - Combinatorial Statistic Finder, The number of alternating sign matrices for a given Dyck path.

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

Cf. A000108.

Sequence in context: A165609 A358462 A141465 * A141663 A011153 A214750

Adjacent sequences: A263213 A263214 A263215 * A263217 A263218 A263219

Keyword

nonn,tabf

Author

Christian Stump, Oct 19 2015

Status

approved