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.

A162764 Minimal total number of floors that an elevator must move to get n persons waiting, respectively, on floors i = 1, 2, ..., n, to their destination floors n-i+1 (= n, n-1, ..., 1), if the elevator can hold up to C = 4 persons at a time and starts at floor 1, and no passenger may get off the elevator before reaching his destination.

Table of values

n a(n)
1 0
2 2
3 4
4 6
5 8
6 10
7 12
8 14
9 16
10 22
11 26
12 32
13 36
14 40
15 44

List of values

[0, 2, 4, 6, 8, 10, 12, 14, 16, 22, 26, 32, 36, 40, 44]