Talk:Domino (mathematics)
WikiProject Mathematics  (Rated Startclass, Lowimportance)  


Tilings of a 2×n rectangle
I seem to recall that the number of tilings of a 2×n rectangle with dominoes is , 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)
 Interesting one. Add it if you can source it. ἀνυπόδητος (talk) 08:27, 26 October 2009 (UTC)
 Young–Fibonacci lattice, Fibonacci number#Identities. — Miym (talk) 20:16, 26 October 2009 (UTC)
This page is based on the copyrighted Wikipedia article "Talk:Domino (mathematics)"; it is used under the Creative Commons
AttributionShareAlike 3.0 Unported License (CCBYSA). You may
redistribute it, verbatim or modified, providing that you comply with
the terms of the CCBYSA