A variant of payphone permutations: given a circular booth with n payphones, a(n) is the number ways for n people to choose the payphones in order, where each person chooses an unoccupied payphone such that the closest occupied payphone is as distant as possible.

A361296

A variant of payphone permutations: given a circular booth with n payphones, a(n) is the number ways for n people to choose the payphones in order, where each person chooses an unoccupied payphone such that the closest occupied payphone is as distant as possible.

Terms

    a(0) =1a(1) =2a(2) =6a(3) =8a(4) =60a(5) =144a(6) =336a(7) =384a(8) =8640a(9) =57600a(10) =221760a(11) =967680a(12) =4193280a(13) =9031680a(14) =14515200a(15) =30965760a(16) =2368880640a(17) =50164531200a(18) =582465945600

External references