Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x. Sequence gives S(n-3,n).
A010849
Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x. Sequence gives S(n-3,n).
Terms
- a(0) =1a(1) =4a(2) =18a(3) =84a(4) =403a(5) =1976a(6) =9860a(7) =49912a(8) =255701a(9) =1323292a(10) =6907830a(11) =36331500a(12) =192339687a(13) =1024140336a(14) =5481165832a(15) =29469454640a(16) =159094662121a(17) =862087135988
External references
- oeis: A010849