cp's OEIS Frontend

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.

%I A361296 #7 Apr 16 2023 20:55:15
%S A361296 1,2,6,8,60,144,336,384,8640,57600,221760,967680,4193280,9031680,
%T A361296 14515200,30965760,2368880640,50164531200,582465945600,7357464576000,
%U A361296 50214695731200,245494068019200,1443672502272000,24103053950976000,200858782924800000,835572536967168000
%N 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.
%H A361296 Max Alekseyev, <a href="/A361296/b361296.txt">Table of n, a(n) for n = 1..100</a>
%H A361296 Max A. Alekseyev, <a href="https://arxiv.org/abs/2304.04324">Enumeration of Payphone Permutations</a>, arXiv:2304.04324 [math.CO], 2023.
%Y A361296 Cf. A095236, A095239, A095912, A358056, A361294, A361295, A362192.
%K A361296 nonn
%O A361296 1,2
%A A361296 _Max Alekseyev_, Apr 08 2023