|
Search: id:A116971
|
|
|
| A116971 |
|
(35*2^( (2*(3*n+2)+2)/3 ) - 2*(3*n+2) -46)/9. |
|
+0
1
|
|
| 10, 56, 242, 988, 3974, 15920, 63706, 254852, 1019438, 4077784, 16311170, 65244716, 260978902, 1043915648, 4175662634, 16702650580, 66810602366, 267242409512, 1068969638098, 4275878552444, 17103514209830, 68414056839376
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Number of moves to solve Type 2 Zig-Zag 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.
|
|
MATHEMATICA
|
Table[(35*2^((2*(3*n + 2) + 2)/3) - 2*(3*n + 2) - 46)/9, {n, 0, 30}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 02 2006
|
|
CROSSREFS
|
Sequence in context: A055911 A014483 A087076 this_sequence A034195 A067250 A061005
Adjacent sequences: A116968 A116969 A116970 this_sequence A116972 A116973 A116974
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Apr 01 2006
|
|
|
Search completed in 0.002 seconds
|
