The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A263412 revision #6

A263412

Triangle read by rows: T(n>=2, k>=0) is the number of standard tableaux of size n whose shape contains k attacking pairs.

1, 1, 1, 2, 0, 1, 1, 3, 0, 5, 0, 0, 1, 1, 4, 0, 11, 0, 5, 4, 0, 0, 0, 1, 1, 5, 0, 19, 0, 21, 10, 0, 9, 5, 5, 0, 0, 0, 0, 1, 1, 6, 0, 29, 0, 49, 20, 21, 35, 21, 15, 0, 28, 0, 0, 6, 0, 0, 0, 0, 0, 1, 1, 7, 0, 41, 0, 92, 35, 84, 90, 56, 91, 42, 134, 0, 0, 21, 28, 20, 14, 0, 0, 7, 0, 0, 0, 0, 0, 0, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,4

COMMENTS

Row sums give A000085, n >= 2.

LINKS

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

FindStat - Combinatorial Statistic Finder, The number of attacking pairs of a standard tableau.

EXAMPLE

Triangle begins:

1,1,

1,2,0,1,