|
| |
|
|
A145787
|
|
Number of times you have to move n cards from one pile to another doing one up, one down, until you obtain the initial sequence.
|
|
0
| |
|
|
1, 2, 2, 3, 3, 6, 6, 4, 4, 6, 6, 10, 10, 14, 14, 5, 5
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Let say you have 3 cards (1 - 2 - 3). You move 1, 2 over 1, 3 below 2. Now you have: (2-1-3). Now you repeat the movement: You move 2, 1 over 2, 3 below 2. Now you have: (1-2-3). The same initial scenario. Total 2 moves. With 4 cards you do it in three moves. For 8 cards you need 4 moves. For 16 cards you need 5 moves. I can assume that for 32 cards I will do it in 6 moves. But for 14 or 15 cards you need 14 moves. I don`t know how to predict how many moves for n cards...
|
|
|
CROSSREFS
| Sequence in context: A175175 A116417 A196055 * A096111 A101081 A147795
Adjacent sequences: A145784 A145785 A145786 * A145788 A145789 A145790
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Hernan Bonsembiante (hernanbon(AT)tutopia.com), Oct 19 2008
|
| |
|
|
