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

%I #17 Jul 03 2023 11:07:38

%S 5,18,66,244,906,3372,12566,46860,174810,652252,2433942,9083004,

%T 33897050,126503148,472111446,1761934444,6575609946,24540472572,

%U 91586214806,341804255580,1275630545370,4760717401612,17767238012502

%N Number of zig-zag paths from top to bottom of a rectangle of width 11 with 2n-1 rows whose color is not 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.: x*(5-12*x+3*x^2)/(1-6*x+9*x^2-2*x^3). - _Colin Barker_, Jan 04 2012

%Y Cf. A153368-A153372.

%K nonn,easy

%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 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)