login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

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 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A153364 Number of zig-zag paths from top to bottom of a rectangle of width 9 with n rows whose color is not that of the top right corner 5

%I #16 Feb 11 2018 10:23:19

%S 4,8,14,28,50,100,180,360,650,1300,2350,4700,8500,17000,30750,61500,

%T 111250,222500,402500,805000,1456250,2912500,5268750,10537500,

%U 19062500,38125000,68968750,137937500,249531250,499062500,902812500,1805625000

%N Number of zig-zag paths from top to bottom of a rectangle of width 9 with n 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>

%F Empirical G.f.: x*(4+8*x-6*x^2-12*x^3)/(1-5*x^2+5*x^4). - _Colin Barker_, Jan 04 2012

%Y A153362, A153363, A153365, A153366, A153367

%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 December 2 11:22 EST 2023. Contains 367517 sequences. (Running on oeis4.)