In this brief note, we prove a result which was "accidentally" found thanks to Neil Sloane's Online Encyclopedia of Integer Sequences. Namely, we prove via elementary techniques that the number of domino tilings of the graph W 4 × P n-1 equals f np n, the product of the n th Fibonacci number and the n thth Pell number.
|Original language||English (US)|
|Journal||Journal of Integer Sequences|
|State||Published - Dec 1 2002|
- Domino tilings
- Fibonacci numbers
- Pell numbers