OFFSET
1,1
COMMENTS
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 13th International Puzzle Party, Amsterdam, Aug 20 1993.
LINKS
Index entries for linear recurrences with constant coefficients, signature (3,-1,-3,2).
FORMULA
a(n) = 3*a(n-1)-a(n-2)-3*a(n-3)+2*a(n-4). G.f.: -x*(x^3-2*x^2-5*x+4) / ((x-1)^2*(x+1)*(2*x-1)). - Colin Barker, Jul 18 2013
MAPLE
f:=n-> if n mod 2 = 0 then 3*2^(n-1)+n-1 else 3*2^(n-1)+n; fi;
MATHEMATICA
f[n_]:=If[EvenQ[n], 3*2^(n-1)+n-1, 3*2^(n-1)+n]; f/@Range[40] (* Harvey P. Dale, Sep 21 2012 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Apr 01 2006
EXTENSIONS
More terms from Colin Barker, Jul 18 2013
STATUS
approved