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.
A144502
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.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =2a(5) =1a(6) =7a(7) =7a(8) =5a(9) =1a(10) =37a(11) =37a(12) =30a(13) =16a(14) =1a(15) =266a(16) =266a(17) =229a(18) =155a(19) =65a(20) =1a(21) =2431a(22) =2431a(23) =2165a(24) =1633a(25) =946a(26) =326a(27) =1a(28) =27007a(29) =27007
External references
- oeis: A144502