The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A116971 a(n) = (35*2^((2*(3*n+2) + 2)/3) - 2*(3*n+2) - 46)/9. 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; refs; listen; history; text; internal format)
 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 *) 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 Sequence in context: A055911 A087076 A014483 * A200054 A034195 A067250 Adjacent sequences:  A116968 A116969 A116970 * A116972 A116973 A116974 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Apr 01 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 18 10:21 EDT 2021. Contains 343087 sequences. (Running on oeis4.)