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.

A340535 Number of domino tilings (or dimer coverings) of the 2n X n grid.

Original entry on oeis.org

1, 1, 5, 41, 2245, 185921, 106912793, 90124167441, 540061286536921, 4652799879944138561, 289415868852204573601981, 25545661075321867247577262777, 16457725663617130715785831809325501, 14905470663149838513993965664256435411841, 99323759360556656337166635121447749135517599089
Offset: 0

Views

Author

Alois P. Heinz, Jan 10 2021

Keywords

Examples

			a(2) = 5:
   .___.   .___.   .___.   .___.   .___.
   |___|   |___|   |___|   | | |   | | |
   |___|   |___|   | | |   |_|_|   |_|_|
   |___|   | | |   |_|_|   |___|   | | |
   |___|   |_|_|   |___|   |___|   |_|_|
.
		

Crossrefs

Programs

  • Maple
    b:= proc(m, n) option remember; local i, j, t, M;
           M:= Matrix(n*m, shape=skewsymmetric);
           for i to n do for j to m do t:= (i-1)*m+j;
              if j b(2*n, n):
    seq(a(n), n=0..15);
  • Mathematica
    T[?OddQ, ?OddQ] = 0;
    T[m_, n_] := Product[2(2+Cos[2 j Pi/(m+1)]+Cos[2 k Pi/(n+1)]), {k, 1, n/2}, {j, 1, m/2}];
    a[n_] := T[2n, n] // Round;
    Table[a[n], {n, 0, 20}] (* Jean-François Alcover, May 27 2022 *)

Formula

a(n) = A187596(2n,n) = A187596(n,2n) = A187616(2n,n).
a(n) = A099390(2n,n) = A099390(n,2n) for n >= 1.