The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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
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
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 May 25 14:05 EDT 2024. Contains 372788 sequences. (Running on oeis4.)