|
| |
|
|
A162762
|
|
Suppose there is a lift can hold only C people, and N people are waiting at floor 1, 2, ..., N, while their destinations are floor N, N - 1, ..., 2, 1 respectively. When C = 2 and the lift starts at floor 1, what is the minimal stairs the lift must move before everyone get to the destination?
|
|
0
| |
|
|
0, 2, 4, 6, 8, 14, 18, 22, 26, 34, 40, 46, 52, 62, 70, 78, 86
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
EXAMPLE
| For n = 2 the a(2) = 2 means the lift needs move only 2 stairs to transport everyone to the destination: the lift loads person at floor 1, and moves to floor 2(1 stair), unloads and loads person at floor 2, then moves to floor 1(1 stair) and unloads.
|
|
|
CROSSREFS
| Sequence in context: A173144 A049015 A005250 * A156097 A039597 A000937
Adjacent sequences: A162759 A162760 A162761 * A162763 A162764 A162765
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Do Zerg (daidodo(AT)gmail.com), Jul 13 2009
|
| |
|
|
