login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

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: A094020 A165609 A141465 * A141663 A011153 A214750

Adjacent sequences:  A263213 A263214 A263215 * A263217 A263218 A263219

KEYWORD

nonn,tabf

AUTHOR

Christian Stump, Oct 19 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 14 15:34 EDT 2022. Contains 356122 sequences. (Running on oeis4.)