A variant of payphone permutations: given a circular booth with n payphones, one of which is already occupied, a(n) is the number ways for n-1 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, and a payphone adjacent to a single occupied payphone is preferred over a payphone sandwiched between two occupied payphones.

A361294

A variant of payphone permutations: given a circular booth with n payphones, one of which is already occupied, a(n) is the number ways for n-1 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, and a payphone adjacent to a single occupied payphone is preferred over a payphone sandwiched between two occupied payphones.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =2a(4) =8a(5) =16a(6) =24a(7) =48a(8) =192a(9) =1536a(10) =4608a(11) =18432a(12) =23040a(13) =92160a(14) =241920a(15) =1935360a(16) =3870720a(17) =41287680a(18) =371589120a(19) =11890851840a(20) =29727129600a(21) =237817036800

External references