|
Search: id:A116969
|
|
|
| A116969 |
|
If n mod 2 = 0 then 3*2^(n-1)+n-1 else 3*2^(n-1)+n. |
|
+0
1
|
|
| 4, 7, 15, 27, 53, 101, 199, 391, 777, 1545, 3083, 6155, 12301, 24589, 49167, 98319, 196625, 393233, 786451, 1572883, 3145749, 6291477, 12582935, 25165847, 50331673, 100663321, 201326619, 402653211, 805306397, 1610612765, 3221225503
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Number of moves to solve Easy Pagoda puzzle.
|
|
REFERENCES
|
Richard I. Hess, Compendium of Over 7000 Wire Puzzles, privately printed, 1991.
Richard I. Hess, Analysis of Ring Puzzles, booklet distributed at 13-th International Puzzle Party, Amsterdam, Aug 20 1993.
|
|
MAPLE
|
f:=n-> if n mod 2 = 0 then 3*2^(n-1)+n-1 else 3*2^(n-1)+n; fi;
|
|
CROSSREFS
|
Sequence in context: A109622 A124286 A027419 this_sequence A131090 A131935 A119749
Adjacent sequences: A116966 A116967 A116968 this_sequence A116970 A116971 A116972
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Apr 01 2006
|
|
|
Search completed in 0.002 seconds
|
