%I A103642
%S A103642 1,26,2197,371293,1631461442,23298085122481,665416609183179841,
%T A103642 494129058146900785408826,1192533292512492016559195008117,
%U A103642 5756130429098929077956071497934208653
%N A103642 Number of tilings of the Aztec dungeon E_n.
%H A103642 M. Ciucu, <a href="http://arXiv.org/abs/math.CO/0501521">Perfect matchings 
               and perfect powers</a>
%F A103642 Recurrence: a(n+6) = 13^(4n+16)*a(n), starting with 1, 2*13, 13^3, 13^5, 
               2*13^8, 13^12.
%o A103642 (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)))
%Y A103642 Sequence in context: A054597 A005643 A054853 this_sequence A087616 A058449 
               A034244
%Y A103642 Adjacent sequences: A103639 A103640 A103641 this_sequence A103643 A103644 
               A103645
%K A103642 nonn
%O A103642 0,2
%A A103642 Ralf Stephan (ralf(AT)ark.in-berlin.de), Feb 19 2005