|
%I #6 May 28 2019 19:32:44
%S 1,26,2197,371293,1631461442,23298085122481,665416609183179841,
%T 494129058146900785408826,1192533292512492016559195008117,
%U 5756130429098929077956071497934208653
%N Number of tilings of the Aztec dungeon E_n.
%H M. Ciucu, <a href="https://arxiv.org/abs/math/0501521">Perfect matchings and perfect powers</a>, arXiv:math/0501521 [math.CO], 2005.
%F Recurrence: a(n+6) = 13^(4n+16)*a(n), starting with 1, 2*13, 13^3, 13^5, 2*13^8, 13^12.
%o (PARI) a(n)=if(n<1,n==0,if(n<6,[2*13,13^3,13^5,2*13^8,13^12][n],13^(4*n-8)*a(n-6)))
%K nonn
%O 0,2
%A _Ralf Stephan_, Feb 19 2005
|
