login

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”).

A153360
Number of zig-zag paths from top to bottom of a rectangle of width 10 with n rows.
1
10, 18, 34, 64, 122, 232, 444, 848, 1626, 3112, 5972, 11442, 21964, 42106, 80832, 155010, 297570, 570760, 1095620, 2101752, 4034252, 7739690, 14855342, 28501710, 54703004, 104959000, 201439550, 386516750, 741790648, 1423365002, 2731617694
OFFSET
1,1
COMMENTS
Number of words of length n using a 10 symbol alphabet where neighboring letters are neighbors in the alphabet. - Andrew Howroyd, Apr 17 2017
FORMULA
G.f.: 2*x*(5+4*x-12*x^2-6*x^3+3*x^4)/(1-x-4*x^2+3*x^3+3*x^4-x^5) [From Maksym Voznyy (voznyy(AT)mail.ru), Aug 11 2009]
MATHEMATICA
LinearRecurrence[{1, 4, -3, -3, 1}, {10, 18, 34, 64, 122}, 31] (* Jean-François Alcover, Jul 01 2018 *)
CROSSREFS
Column 10 of A220062.
Twice A090994.
Sequence in context: A014006 A090995 A363769 * A189323 A064485 A007938
KEYWORD
easy,nonn
AUTHOR
Joseph Myers, Dec 24 2008
EXTENSIONS
G.f. proposed by Maksym Voznyy checked and corrected by R. J. Mathar, Sep 16 2009.
STATUS
approved