|
Search: id:A162763
|
|
|
| A162763 |
|
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 = 3 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, 18, 22, 27, 31, 35, 39, 47, 53, 60
(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: A101814 A034090 A146344 this_sequence A113242 A085884 A094390
Adjacent sequences: A162760 A162761 A162762 this_sequence A162764 A162765 A162766
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Do Zerg (daidodo(AT)gmail.com), Jul 13 2009
|
|
|
Search completed in 0.002 seconds
|
