|
|
A187618
|
|
Triangle T(m,n) read by rows: number of domino tilings of the 2m X 2n grid (0 <= m <= n).
|
|
7
|
|
|
1, 1, 2, 1, 5, 36, 1, 13, 281, 6728, 1, 34, 2245, 167089, 12988816, 1, 89, 18061, 4213133, 1031151241, 258584046368, 1, 233, 145601, 106912793, 82741005829, 65743732590821, 53060477521960000, 1, 610, 1174500, 2720246633, 6675498237130, 16848161392724969, 43242613716069407953, 112202208776036178000000
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
A099390 is the main entry for this problem.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1
1 2
1 5 36
1 13 281 6728
1 34 2245 167089 12988816
1 89 ...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|