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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A112830 Table of number of domino tilings of generalized Aztec pillows of type (1, ..., 1, 3, 1, ..., 1)_n. 1
 1, 1, 5, 1, 10, 25, 1, 17, 65, 113, 1, 26, 146, 346, 481, 1, 37, 292, 932, 1637, 1985, 1, 50, 533, 2248, 5013, 7218, 8065, 1, 65, 905, 4937, 13897, 24201, 30529, 32513, 1, 82, 1450, 10018, 35218, 74530, 108970, 126034, 130561, 1, 101, 2216, 19016, 82436 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS The number of tilings of a generalized Aztec pillow of type (k 1's followed by a 3 followed by n-k-1 1's) is entry (n,k+1). LINKS C. Hanusa, A Gessel-Viennot-Type Method for Cycle Systems with Applications to Aztec Pillows, PhD Thesis, 2005, University of Washington, Seattle, USA. FORMULA T(2*n,n) = A264960(n). - Peter Bala, Nov 29 2015 EXAMPLE The number of tilings of a generalized Aztec pillow of type (1,1,3,1)_n is entry (4,3) = 346. MAPLE matrix(11, 11, [seq([seq(((2^n-sum(binomial(n, j), j=0..k))^2+(binomial(n-1, k))^2)/2, n=k+1..k+11)], k=0..10)]); CROSSREFS A092440 (main diagonal), A092441 (first subdiagonal), A002522 (column k = 1), A066455 (column k = 2). Cf. A264960. Sequence in context: A135855 A116547 A013612 * A209669 A189745 A062967 Adjacent sequences:  A112827 A112828 A112829 * A112831 A112832 A112833 KEYWORD easy,nonn,tabl AUTHOR Christopher Hanusa (chanusa(AT)math.binghamton.edu), Sep 21 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.

Last modified April 17 06:46 EDT 2021. Contains 343059 sequences. (Running on oeis4.)