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.

1, 2, 6, 8, 60, 144, 336, 384, 8640, 57600, 221760, 967680, 4193280, 9031680, 14515200, 30965760, 2368880640, 50164531200, 582465945600, 7357464576000, 50214695731200, 245494068019200, 1443672502272000, 24103053950976000, 200858782924800000, 835572536967168000

Offset: 1

Author

Max Alekseyev, Apr 08 2023

Keywords

• nonn

Links

• Max Alekseyev, Table of n, a(n) for n = 1..100
• Max A. Alekseyev, Enumeration of Payphone Permutations, arXiv:2304.04324 [math.CO], 2023.

Crossrefs

Cf. A095236, A095239, A095912, A358056, A361294, A361295, A362192.