272501

Appears in sequences

• Column 3 of array in A144502.at n=5A144499
• 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=39A144502
• a(n) = 840*n^2 - 23100*n + 86861.at n=34A216257