A153340 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A153340

Number of zig-zag paths from top to bottom of a rectangle of width 8 with n rows.

8, 14, 26, 48, 90, 168, 316, 592, 1114, 2090, 3932, 7382, 13884, 26076, 49032, 92110, 173170, 325360, 611618, 1149248, 2160212, 4059360, 7629882, 14338290, 26949004, 50644750, 95185300, 178883252, 336200648, 631835054, 1187485194, 2231705808

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Number of words of length n using an 8-symbol alphabet where neighboring letters are neighbors in the alphabet. - Andrew Howroyd, Apr 17 2017

LINKS

Table of n, a(n) for n=1..32.

Joseph Myers, BMO 2008--2009 Round 1 Problem 1---Generalisation

Index entries for linear recurrences with constant coefficients, signature (1,3,-2,-1).

FORMULA

G.f.: 2*x*(4+3*x-6*x^2-2*x^3)/((1-x)*(1-3*x^2-x^3)). - Colin Barker, May 10 2012

MATHEMATICA