Talk:Domino (mathematics)

Tilings of a 2×n rectangle

I seem to recall that the number of tilings of a 2×n rectangle with dominoes is $F_{n}$ , the nth Fibonacci number; this problem appears in Concrete Mathematics, by Graham, Knuth, and Patashnik. Is this sufficiently notable to be mentioned? —Dominus (talk) 08:11, 26 October 2009 (UTC)[reply]

Interesting one. Add it if you can source it. --ἀνυπόδητος (talk) 08:27, 26 October 2009 (UTC)[reply]

Young–Fibonacci lattice, Fibonacci number#Identities. — Miym (talk) 20:16, 26 October 2009 (UTC)[reply]