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!)
A153372 Number of zig-zag paths from top to bottom of a rectangle of width 11 with 2n-1 rows whose color is that of the top right corner. 5

%I #10 Jul 03 2023 11:06:35

%S 6,20,72,264,976,3624,13488,50264,187440,699240,2609008,9735768,

%T 36332016,135588200,506012592,1888445784,7047737776,26302439784,

%U 98161890288,366344859224,1367217022320,5102522181480,19042869606448

%N Number of zig-zag paths from top to bottom of a rectangle of width 11 with 2n-1 rows whose color is that of the top right corner.

%H 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 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (6, -9, 2).

%F Empirical g.f. -2*x*(3-8*x+3*x^2) / ( (2*x-1)*(x^2-4*x+1) ) with a(n)= +6*a(n-1) -9*a(n-2) +2*a(n-3) and a(n) = (2^n+8*A001075(n))/3. - _R. J. Mathar_, Jun 16 2011

%Y A153368, A153369, A153370, A153371, A153373

%K easy,nonn

%O 1,1

%A _Joseph Myers_, Dec 24 2008

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 April 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)