2199722

Appears in sequences

• Row 4 of array in A144502.at n=5A144497
• Square array read by antidiagonals upwards: T(n,k) is the number of scenarios for the gift exchange problem in which each gift can be stolen at most once, when there are n gifts in the pool and k gifts (not yet frozen) in peoples' hands.at n=50A144502