Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A103642
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A103642 Number of tilings of the Aztec dungeon E_n. +0
1
1, 26, 2197, 371293, 1631461442, 23298085122481, 665416609183179841, 494129058146900785408826, 1192533292512492016559195008117, 5756130429098929077956071497934208653 (list; graph; listen)
OFFSET

0,2

LINKS

M. Ciucu, Perfect matchings and perfect powers

FORMULA

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

PROGRAM

(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)))

CROSSREFS

Sequence in context: A054597 A005643 A054853 this_sequence A087616 A058449 A034244

Adjacent sequences: A103639 A103640 A103641 this_sequence A103643 A103644 A103645

KEYWORD

nonn

AUTHOR

Ralf Stephan (ralf(AT)ark.in-berlin.de), Feb 19 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research