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!)
A153367 Number of zig-zag paths from top to bottom of a rectangle of width 9 with 2n-1 rows whose color is not that of the top right corner. 5
4, 14, 50, 180, 650, 2350, 8500, 30750, 111250, 402500, 1456250, 5268750, 19062500, 68968750, 249531250, 902812500, 3266406250, 11817968750, 42757812500, 154699218750, 559707031250, 2025039062500, 7326660156250, 26508105468750 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
Empirical g.f.: x*(4-6*x)/(1-5*x+5*x^2). - Colin Barker, Jan 04 2012
Conjectures from Colin Barker, Feb 11 2018: (Start)
a(n) = (2^(-n)*((5-sqrt(5))^n*(-5+3*sqrt(5)) + (5+sqrt(5))^n*(5+3*sqrt(5)))) / (5*sqrt(5)) for n>0.
a(n) = 5*a(n-1) - 5*a(n-2) for n>2.
(End)
Assuming Colin Barker's conjectures, a(2*n) = 2*5^(n-1)*Lucas(2*(n+1)), a(2*n+1) = 2*5^n*Fibonacci(2*n+3). - Ehren Metcalfe, Apr 21 2018
CROSSREFS
Sequence in context: A229314 A055099 A335921 * A211304 A047065 A047008
KEYWORD
nonn,easy
AUTHOR
Joseph Myers, Dec 24 2008
STATUS
approved

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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)