|
Search: id:A114292
|
|
|
| A114292 |
|
Modified Schroeder numbers for q=3. |
|
+0
8
|
|
| 1, 1, 1, 2, 2, 1, 5, 5, 2, 1, 16, 16, 6, 2, 1, 57, 57, 21, 6, 2, 1, 224, 224, 82, 22, 6, 2, 1, 934, 934, 341, 89, 22, 6, 2, 1, 4092, 4092, 1492, 384, 90, 22, 6, 2, 1, 18581, 18581, 6770, 1729, 393, 90, 22, 6, 2, 1, 86888, 86888, 31644, 8044, 1794, 394, 90, 22, 6, 2, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
a(i,j) is the number of paths from (i,i) to (j,j) 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. The Hamburger Theorem implies that we can use this table to calculate the number of domino tilings of an Aztec 3-pillow (A112833). To calculate this quantity, let P_n = the principal n X n submatrix of this array. If J_n = the back-diagonal matrix of order n, then A112833(n)=det(P_n+J_nP_n^(-1)J_n).
|
|
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(0,3)=5.
|
|
CROSSREFS
|
See also A112833-A112844 and A114293-A114299.
Sequence in context: A079220 A158068 A123971 this_sequence A141751 A079222 A033184
Adjacent sequences: A114289 A114290 A114291 this_sequence A114293 A114294 A114295
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Christopher Hanusa (chanusa(AT)math.binghamton.edu), Nov 21 2005
|
|
|
Search completed in 0.002 seconds
|
