cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A137308 Number of dimer coverings on n X n square if n is even; number of dimer arrangements with exactly one monomer if n is odd.

This page as a plain text file.
%I A137308 #18 Feb 16 2025 08:33:07
%S A137308 1,1,2,18,36,2180,6728,2200776,12988816,20355006224,258584046368,
%T A137308 1801272981919008,53060477521960000,1560858753560238398528,
%U A137308 112202208776036178000000,13428038397958481723104394368
%N A137308 Number of dimer coverings on n X n square if n is even; number of dimer arrangements with exactly one monomer if n is odd.
%C A137308 Subsequence of even-subscripted terms is A004003.
%C A137308 Rightmost diagonal of A242861.
%C A137308 Also the number of maximum matchings in the n X n grid graph. - _Eric W. Weisstein_, May 28 2017
%D A137308 Y. Kong, Packing dimers on (2p+1) X (2q+1) lattices, Phys. Rev. E 73 (2006) 016106
%H A137308 Steven Finch, <a href="/A137308/b137308.txt">Table of n, a(n) for n = 0..19</a>
%H A137308 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GridGraph.html">Grid Graph</a>
%H A137308 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Matching.html">Matching</a>
%H A137308 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximumIndependentEdgeSet.html">Maximum Independent Edge Set</a>
%Y A137308 Cf. A004003, A242861.
%K A137308 nonn
%O A137308 0,3
%A A137308 _Steven Finch_, Apr 03 2008
%E A137308 a(0)=1 prepended by _Alois P. Heinz_, Aug 15 2021