The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A153362 Number of zig-zag paths from top to bottom of a rectangle of width 9 with n rows. 6
9, 16, 30, 56, 106, 200, 380, 720, 1370, 2600, 4950, 9400, 17900, 34000, 64750, 123000, 234250, 445000, 847500, 1610000, 3066250, 5825000, 11093750, 21075000, 40137500, 76250000, 145218750, 275875000, 525406250, 998125000, 1900937500 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Number of words of length n using a 9 symbol alphabet where neighboring letters are neighbors in the alphabet. - Andrew Howroyd, Apr 17 2017
LINKS
FORMULA
Empirical G.f.: x*(9+16*x-15*x^2-24*x^3+x^4)/(1-5*x^2+5*x^4). [Colin Barker, Sep 02 2012]
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<k, b[n-1, i+1, k], 0]]];
a[n_] := b[n, 0, 9];
Array[a, 31] (* Jean-François Alcover, Jul 01 2018, after Alois P. Heinz *)
CROSSREFS
Column 9 of A220062.
Sequence in context: A351435 A369642 A162616 * A039788 A175652 A348233
KEYWORD
easy,nonn
AUTHOR
Joseph Myers, Dec 24 2008
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 11:43 EDT 2024. Contains 372504 sequences. (Running on oeis4.)