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.

A162761 Minimal total number of floors an elevator must move to transport n people initially waiting at floors i = 1, ..., n to their destination floors n-i+1 (= n, ..., 1), when the elevator can hold at most one person at a time and starts at floor 1, and no passenger may get off the elevator before reaching his/her destination.

Table of values

n a(n)
1 0
2 2
3 4
4 9
5 13
6 20
7 26
8 35
9 43
10 54
11 64
12 77
13 89
14 104
15 118
16 135
17 151
18 170
19 188
20 209
21 229
22 252
23 274
24 299
25 323
26 350
27 376
28 405
29 433
30 464
31 494
32 527
33 559
34 594
35 628
36 665
37 701
38 740
39 778
40 819
41 859
42 902
43 944
44 989
45 1033
46 1080
47 1126
48 1175
49 1223
50 1274
51 1324
52 1377
53 1429

List of values

[0, 2, 4, 9, 13, 20, 26, 35, 43, 54, 64, 77, 89, 104, 118, 135, 151, 170, 188, 209, 229, 252, 274, 299, 323, 350, 376, 405, 433, 464, 494, 527, 559, 594, 628, 665, 701, 740, 778, 819, 859, 902, 944, 989, 1033, 1080, 1126, 1175, 1223, 1274, 1324, 1377, 1429]

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

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