|
Search: id:A114296
|
|
|
| A114296 |
|
First row of Modified Schroeder numbers for q=3 (A114292). |
|
+0
1
|
|
| 1, 1, 2, 5, 16, 57, 224, 934, 4092, 18581, 86888
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
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.
|
|
REFERENCES
|
C. Hanusa (2005). A Gessel-Viennot-Type Method for Cycle Systems with Applications to Aztec Pillows. PhD Thesis. University of Washington, Seattle, USA.
|
|
EXAMPLE
|
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.
|
|
CROSSREFS
|
See also A112833-A112844 and A114292-A114299.
Sequence in context: A052815 A082789 A072110 this_sequence A121689 A009225 A157612
Adjacent sequences: A114293 A114294 A114295 this_sequence A114297 A114298 A114299
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Christopher Hanusa (chanusa(AT)math.binghamton.edu), Nov 21 2005
|
|
EXTENSIONS
|
Corrected by Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 04 2006
|
|
|
Search completed in 0.002 seconds
|
