cp's OEIS Frontend

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

%I A153368 #21 Jul 03 2023 10:59:37
%S A153368 11,20,38,72,138,264,508,976,1882,3624,6996,13488,26054,50264,97124,
%T A153368 187440,362250,699240,1351492,2609008,5042950,9735768,18818772,
%U A153368 36332016,70229066,135588200,262091348,506012592,978124038,1888445784,3650380228
%N A153368 Number of zig-zag paths from top to bottom of a rectangle of width 11 with n rows.
%C A153368 Heuristically, a(n) = +6*a(n-2) -9*a(n-4) +2*a(n-6). - _R. J. Mathar_, Jun 16 2011
%C A153368 Number of words of length n using a 11 symbol alphabet where neighboring letters are neighbors in the alphabet. - _Andrew Howroyd_, Apr 17 2017
%H A153368 Joseph Myers, <a href="http://www.polyomino.org.uk/publications/2008/bmo1-2009-q1.pdf">BMO 2008--2009 Round 1 Problem 1---Generalisation</a>
%H A153368 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0, 6, 0, -9, 0, 2).
%F A153368 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
%F A153368 a(n) = A153369(n) + A153370(n). - _Andrew Howroyd_, Apr 17 2017
%t A153368 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]]];
%t A153368 a[n_] := b[n, 0, 11];
%t A153368 Array[a, 31] (* _Jean-François Alcover_, Jul 01 2018, after _Alois P. Heinz_ *)
%Y A153368 Column 11 of A220062.
%Y A153368 Cf. A153369, A153370, A153371, A153372 (bisection), A153373.
%K A153368 easy,nonn
%O A153368 1,1
%A A153368 _Joseph Myers_, Dec 24 2008