login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103641 Number of tilings of the Aztec dungeon D_n. 0
1, 2, 13, 2197, 742586, 815730721, 23298085122481, 1330833218366359682, 247064529073450392704413, 1192533292512492016559195008117, 11512260858197858155912142995868417306 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..10.

M. Ciucu, Perfect matchings and perfect powers, arXiv:math/0501521 [math.CO], 2005.

FORMULA

Recurrence: a(n+6) = 13^(4n+12)*a(n), starting with 1, 2, 13, 13^3, 2*13^5, 13^8.

PROG

(PARI) a(n)=if(n<1, n==0, if(n<6, [2, 13, 13^3, 2*13^5, 13^8][n], 13^(4*n-12)*a(n-6)))

CROSSREFS

Sequence in context: A004071 A174363 A158026 * A144983 A110820 A139519

Adjacent sequences:  A103638 A103639 A103640 * A103642 A103643 A103644

KEYWORD

nonn

AUTHOR

Ralf Stephan, Feb 19 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 18 09:39 EST 2020. Contains 332011 sequences. (Running on oeis4.)