|
Search: id:A162764
|
|
|
| A162764 |
|
Suppose there is a lift that 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 = 4 and the lift starts at floor 1, what is the minimal stairs the lift must move before everyone get to the destination? |
|
+0
1
|
|
| 0, 2, 4, 6, 8, 10, 12, 14, 16, 22, 26, 32, 36, 40, 44
(list; graph; listen)
|
|
|
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: A058066 A118081 A152483 this_sequence A082893 A024807 A063459
Adjacent sequences: A162761 A162762 A162763 this_sequence A162765 A162766 A162767
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
DoZerg (daidodo(AT)gmail.com), Jul 13 2009
|
|
|
Search completed in 0.002 seconds
|
