This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A124997 Number of fault-free domino tilings (or dimer coverings) of a 2n X 2n square. 2
 0, 0, 0, 25506, 1759280998, 854818404562894, 3588226034666378581610, 138311081613064367684548901556, 50272239752141442901464758051467073726, 174927321882862834702052846250836696969014873138, 5889117928937174007411459040006660524033737246962655301188 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Enumerates a subclass of the things counted by A004003. "Fault-free" means that every straight line through the interior of the square hits the interior of some domino. LINKS Xu Mingkuan, Table of n, a(n) for n = 1..12 CROSSREFS Cf. A004003. Sequence in context: A251227 A183648 A242141 * A031837 A237865 A202646 Adjacent sequences:  A124994 A124995 A124996 * A124998 A124999 A125000 KEYWORD nonn AUTHOR Don Knuth, Jun 26 2008 EXTENSIONS a(7) from Alois P. Heinz, Oct 19 2015 a(8)-a(11) from Xu Mingkuan, Dec 23 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 15 01:20 EST 2018. Contains 318141 sequences. (Running on oeis4.)