cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A358056 Given a row of n payphones (or phone booths), all initially unused, how many ways are there for n people to choose the payphones, assuming each always chooses one of the most distant payphones from those in use already? We consider here only the distance to the closest neighbor (in contrast to A095236).

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 8
5 20
6 48
7 216
8 576
9 1392
10 7200
11 43200
12 184320
13 1065600
14 4314240
15 21611520
16 150958080
17 573834240
18 2293401600
19 32107622400
20 236017152000
21 2798762803200
22 22493915136000
23 189837914112000
24 1165284436377600
25 13260174468710400
26 148874616963072000

List of values

[1, 1, 2, 4, 8, 20, 48, 216, 576, 1392, 7200, 43200, 184320, 1065600, 4314240, 21611520, 150958080, 573834240, 2293401600, 32107622400, 236017152000, 2798762803200, 22493915136000, 189837914112000, 1165284436377600, 13260174468710400, 148874616963072000]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.