login
Triangle T(m,n) read by rows: number of domino tilings of the 2m X 2n grid (0 <= m <= n).
7

%I #14 Mar 14 2015 23:00:43

%S 1,1,2,1,5,36,1,13,281,6728,1,34,2245,167089,12988816,1,89,18061,

%T 4213133,1031151241,258584046368,1,233,145601,106912793,82741005829,

%U 65743732590821,53060477521960000,1,610,1174500,2720246633,6675498237130,16848161392724969,43242613716069407953,112202208776036178000000

%N Triangle T(m,n) read by rows: number of domino tilings of the 2m X 2n grid (0 <= m <= n).

%C A099390 is the main entry for this problem.

%H Alois P. Heinz, <a href="/A187618/b187618.txt">Rows n = 0..14, flattened</a>

%H <a href="/index/Do#domino">Index entries for sequences related to dominoes</a>

%e Triangle begins:

%e 1

%e 1 2

%e 1 5 36

%e 1 13 281 6728

%e 1 34 2245 167089 12988816

%e 1 89 ...

%Y Cf. A099390, A187596, A187616, A187617.

%K nonn,tabl

%O 0,3

%A _N. J. A. Sloane_, Mar 12 2011

%E More terms from _Nathaniel Johnston_, Mar 22 2011