This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A153368 Number of zig-zag paths from top to bottom of a rectangle of width 11 with n rows. 5
 11, 20, 38, 72, 138, 264, 508, 976, 1882, 3624, 6996, 13488, 26054, 50264, 97124, 187440, 362250, 699240, 1351492, 2609008, 5042950, 9735768, 18818772, 36332016, 70229066, 135588200, 262091348, 506012592, 978124038, 1888445784, 3650380228 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Heuristically, a(n) = +6*a(n-2) -9*a(n-4) +2*a(n-6). - R. J. Mathar, Jun 16 2011 Number of words of length n using a 11 symbol alphabet where neighboring letters are neighbors in the alphabet. - Andrew Howroyd, Apr 17 2017 LINKS Joseph Myers, BMO 2008--2009 Round 1 Problem 1---Generalisation FORMULA Empirical G.f.: x*(11+20*x-28*x^2-48*x^3+9*x^4+12*x^5)/((1-2*x^2)*(1-4*x^2+x^4)). - Colin Barker, Apr 17 2012 a(n) = A153369(n) + A153370(n). - Andrew Howroyd, Apr 17 2017 MATHEMATICA b[n_, i_, k_] := b[n, i, k] = If[n == 0, 1, If[i == 0, Sum[b[n - 1, j, k], {j, 1, k}], If[i>1, b[n-1, i-1, k], 0] + If[i

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 December 14 19:27 EST 2019. Contains 329987 sequences. (Running on oeis4.)