cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A112833 Number of domino tilings of a 3-pillow of order n.

Original entry on oeis.org

1, 2, 5, 20, 117, 1024, 13357, 259920, 7539421, 326177280, 21040987113, 2024032315968, 290333133984905, 62102074862600192, 19808204598680574457, 9421371079480456587520, 6682097668647718038428569, 7067102111711681259234263040, 11145503882824383823706372042925
Offset: 0

Views

Author

Christopher Hanusa (chanusa(AT)math.binghamton.edu), Sep 21 2005

Keywords

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.
a(n)^(1/n^2) tends to 1.2211384384439007690866503099... - Vaclav Kotesovec, May 19 2020

Examples

			The number of domino tilings of the 3-pillow of order 4 is 117=3^2*13.

Links

Crossrefs

This sequence breaks down as A112834^2 times A112835, where A112835 is not necessarily squarefree.
5-pillows: A112836-A112838; 7-pillows: A112839-A112841; 9-pillows: A112842-A112844.
Related to A071101 and A071100.

Programs

  • Maple
    with(LinearAlgebra):
b:= proc(x, y, k) option remember;
      `if`(y>x or y Matrix(n, (i, j)-> b(i-1, i-1, j-1)):
R:= n-> Matrix(n, (i, j)-> `if`(i+j=n+1, 1, 0)):
a:= n-> Determinant(P(n)+R(n).(P(n)^(-1)).R(n)):
seq(a(n), n=0..20);  # Alois P. Heinz, Apr 26 2013
  • Mathematica
    b[x_, y_, k_] := b[x, y, k] = If[y>x || yJean-François Alcover, Nov 08 2015, after Alois P. Heinz *)

A112835 Small-number statistic from the enumeration of domino tilings of a 3-pillow of order n.

Original entry on oeis.org

1, 2, 5, 5, 13, 16, 37, 45, 109, 130, 313, 377, 905, 1088, 2617, 3145, 7561, 9090, 21853, 26269, 63157, 75920, 182525, 219413, 527509, 634114, 1524529, 1832625, 4405969, 5296384, 12733489, 15306833, 36800465, 44237570, 106355317
Offset: 0

Views

Author

Christopher Hanusa (chanusa(AT)math.binghamton.edu), Sep 21 2005

Keywords

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.
Plotting A112835(n+2)/A112835(n) gives an intriguing damped sine curve.

Examples

			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.

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

Crossrefs

A112833 breaks down as A112834^2 times A112835, where A112835 is not necessarily squarefree.
5-pillows: A112836-A112838; 7-pillows: A112839-A112841; 9-pillows: A112842-A112844.
Cf. A071100, A071101.

Programs

  • 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 */

Formula

a(2*n + 2) = A071100(n). a(2*n + 3) = A071101(n).
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

A206625 Expansion of x * (1 + x) * (1 - x^2) * (1 + x^3) / (1 - 2*x^2 - 2*x^4 - 2*x^6 + x^8) in powers of x.

Original entry on oeis.org

0, 1, 1, 1, 2, 5, 5, 13, 16, 37, 45, 109, 130, 313, 377, 905, 1088, 2617, 3145, 7561, 9090, 21853, 26269, 63157, 75920, 182525, 219413, 527509, 634114, 1524529, 1832625, 4405969, 5296384, 12733489, 15306833, 36800465, 44237570, 106355317
Offset: 0

Views

Author

Michael Somos, Feb 10 2012

Keywords

Comments

This is a divisibility sequence; that is, if n divides m, then a(n) divides a(m).

Examples

			G.f. = x + x^2 + x^3 + 2*x^4 + 5*x^5 + 5*x^6 + 13*x^7 + 16*x^8 + 37*x^9 + ...

References

  • J. A. Sjogren, Cycles and spanning trees. Math. Comput. Modelling 15, No.9, 87-102 (1991).

Links

Crossrefs

Cf. A071100 (bisection), A071101 (bisection), A112835, A138573.

Programs

  • Magma
    m:=25; R:=PowerSeriesRing(Integers(), m); [0] cat Coefficients(R!(x*(1+x)*(1-x^2)*(1+x^3)/(1-2*x^2-2*x^4-2*x^6+x^8 ))); // G. C. Greubel, Aug 12 2018
  • Mathematica
    CoefficientList[Series[x*(1+x)*(1-x^2)*(1+x^3)/(1-2*x^2-2*x^4-2*x^6+x^8 ), {x, 0, 50}], x] (* G. C. Greubel, Aug 12 2018 *)
  • PARI
    {a(n) = my(m = abs(n)); polcoeff( x * (1 + x) * (1 - x^2) * (1 + x^3) / (1 - 2*x^2 - 2*x^4 - 2*x^6 + x^8) + x * O(x^m), m)};
  • PARI
    {a(n) = my(m = abs(n), v); v = polroots( Pol([ 1, 2, 4, 2, 1])); sqrtint( round( prod( k=1, 4, v[k]^m - 1, 2^(m%2) / 20)))};

Formula

G.f.: x * (1 + x) * (1 - x^2) * (1 + x^3) / (1 - 2*x^2 - 2*x^4 - 2*x^6 + x^8).
a(n) = a(-n) = 2*a(n-2) + 2*a(n-4) + 2*a(n-6) - a(n-8) for all n in Z.
a(2*n + 5) = A071100(n). a(2*n + 6) = A071101(n). a(n + 3) = A112835(n). a(2*n) = A138573(n).
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.