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.

A276657 Number of ways to occupy n unlabeled phone booths in a circle one by one, each time picking a phone booth adjacent to the smallest number of previously occupied phone booths.

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 8
6 28
7 72
8 432
9 1728
10 9792
11 56448
12 372096
13 2419200
14 19526400
15 144806400
16 1310515200
17 11338444800
18 112903372800
19 1102226227200
20 12163505356800
21 131369759539200
22 1589020051046400
23 18899570737152000
24 247773823008768000
25 3220159580209152000
26 45535430530695168000

List of values

[1, 1, 2, 2, 8, 28, 72, 432, 1728, 9792, 56448, 372096, 2419200, 19526400, 144806400, 1310515200, 11338444800, 112903372800, 1102226227200, 12163505356800, 131369759539200, 1589020051046400, 18899570737152000, 247773823008768000, 3220159580209152000, 45535430530695168000]

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

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