|
Search: id:A133300
|
|
|
| A133300 |
|
Square array read along upward antidiagonals. S(n,m) is the number of domino tilings of an n-row and m-column checkerboard with a black upper-left square, where any vertical dominoes are allowed, and horizontal dominoes must be placed so that the black square is on the left. |
|
+0
1
|
|
| 0, 1, 1, 0, 1, 0, 1, 2, 1, 1, 0, 1, 0, 1, 0, 1, 3, 1, 4, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 4, 1, 9, 1, 8, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 5, 1, 16, 1, 27, 1, 16, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 6, 1, 25, 1, 64, 1, 81, 1, 32, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 7, 1, 36, 1, 125, 1, 256, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
FORMULA
|
S(n,m) = 0 if m and n are odd, 1 if n is even, or [(n+1)/2]^(m/2) if n is odd and m is even
|
|
EXAMPLE
|
Using any vertical dominoes and the horizontal domino |*| |, there are two ways to tile the checkerboard
-----
|*| |
-----
| |*|
-----
|*| |
-----
|
|
CROSSREFS
|
Adjacent sequences: A133297 A133298 A133299 this_sequence A133301 A133302 A133303
Sequence in context: A007273 A016319 A117208 this_sequence A090464 A044934 A124761
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Bridget Eileen Tenner (bridget(AT)math.depaul.edu), Oct 17 2007
|
|
|
Search completed in 0.002 seconds
|
