OFFSET
0,1
COMMENTS
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 13th International Puzzle Party, Amsterdam, Aug 20 1993.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (6,-9,4).
FORMULA
a(n) = 6*a(n-1)-9*a(n-2)+4*a(n-3). G.f.: 2*(5-2*x-2*x^2)/((1-x)^2*(1-4*x)). [Colin Barker, Sep 09 2012]
MATHEMATICA
Table[(35*2^((2*(3*n + 2) + 2)/3) - 2*(3*n + 2) - 46)/9, {n, 0, 30}] (* Stefan Steinerberger, Apr 02 2006 *)
LinearRecurrence[{6, -9, 4}, {10, 56, 242}, 30] (* Harvey P. Dale, Sep 08 2021 *)
PROG
(Magma) [Round((35*2^((2*(3*n + 2) + 2)/3 ) - 2*(3*n + 2) - 46)/9): n in [0..25]] // Vincenzo Librandi, Sep 09 2012
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Apr 01 2006
STATUS
approved