OFFSET
0,2
COMMENTS
A 3-pillow is also called an Aztec pillow. The 3-pillow of order n is a rotationally-symmetric region. It has a 2 X 2n central band of squares and then steps up from this band with steps of 3 horizontal squares to every 1 vertical square and steps down with steps of 1 horizontal square to every 1 vertical square.
REFERENCES
C. Hanusa (2005). A Gessel-Viennot-Type Method for Cycle Systems with Applications to Aztec Pillows. PhD Thesis. University of Washington, Seattle, USA.
LINKS
A D Mednykh, I A Mednykh, The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic, arXiv preprint arXiv:1711.00175, 2017. See Section 4.
FORMULA
G.f.: (1 + x - x^2 + x^4 - x^5 - x^6) / (1 - 2*x^2 - 2*x^4 - 2*x^6 + x^8) = (1 + x) * (1 - x^2) * (1 + x^3) / (1 - 2*x^2 - 2*x^4 - 2*x^6 + x^8). - Michael Somos, Dec 15 2011
a(-n) = a(-6 + n). a(-1) = a(-2) = 1, a(-3) = 0. a(n) = 2*a(n-2) + 2*a(n-4) + 2*a(n-6) - a(n-8). - Michael Somos, Dec 15 2011
EXAMPLE
1 + 2*x + 5*x^2 + 5*x^3 + 13*x^4 + 16*x^5 + 37*x^6 + 45*x^7 + 109*x^8 + ...
The number of domino tilings of the 3-pillow of order 4 is 117=3^2*13. A112835(4)=13.
PROG
(PARI) {a(n) = local(m = abs(n+3)); polcoeff( (x + x^2 - x^3 + x^5 - x^6 - x^7) / (1 - 2*x^2 - 2*x^4 - 2*x^6 + x^8) + x * O(x^m), m)} /* Michael Somos, Dec 15 2011 */
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Christopher Hanusa (chanusa(AT)math.binghamton.edu), Sep 21 2005
STATUS
approved