# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a114296 Showing 1-1 of 1 %I A114296 #24 May 14 2017 09:30:13 %S A114296 1,1,2,5,16,57,224,934,4092,18581,86888,415856,2029160,10061161, %T A114296 50568680,257129888,1320619176,6842177174,35722456976,187772944964, %U A114296 992991472328,5279633960181,28208037066528,151373637844440,815568695756496,4410124252008112 %N A114296 First row of Modified Schroeder numbers for q=3 (A114292). %C A114296 a(i) is the number of paths from (0,0) to (i,i) using steps of length (0,1), (1,0) and (1,1), not passing above the line y=x nor below the line y=x/2. %H A114296 Alois P. Heinz, Table of n, a(n) for n = 0..1000 %H A114296 C. Hanusa, A Gessel-Viennot-Type Method for Cycle Systems with Applications to Aztec Pillows, PhD Thesis, 2005, University of Washington, Seattle, USA. %F A114296 a(n) ~ c * (3+2*sqrt(2))^n / n^(3/2), where c = 0.02741316010407391604887680145773... . - _Vaclav Kotesovec_, Sep 07 2014 %e A114296 The number of paths from (0,0) to (3,3) staying between the lines y=x and y=x/2 using steps of length (0,1), (1,0) and (1,1) is a(3)=5. %p A114296 b:= proc(x, y) option remember; `if`(y>x or y b(n, n): %p A114296 seq(a(n), n=0..30); # _Alois P. Heinz_, Apr 25 2013 %t A114296 b[x_, y_] := b[x, y] = If[y>x || y