1673535

Appears in sequences

• Consider 2n tennis players; a(n) is the number of matches needed to let every possible pair play each other.at n=29A062346
• Array read by antidiagonals: T(r,n) = number of two-stack sortable r-permutations.at n=51A093346