A340176 -id:A340176 - cp's OEIS frontend

A007725 Number of spanning trees of Aztec diamonds of order n.

1, 4, 768, 18170880, 48466759778304, 14179455913065873408000, 449549878218740179750040371200000, 1534679662450485063038349752542766158611218432, 561985025597966566291275288056092110323394467225010519932928

Offset: 0

Richard Stanley

nonn

Timothy Y. Chow, The Q-spectrum and spanning trees of tensor products of bipartite graphs, Proc. Amer. Math. Soc. 125 (1997), no. 11, 3155-3161.
D. E. Knuth, Aztec Diamonds, Checkerboard Graphs, and Spanning Trees, arXiv:math/9501234 [math.CO], 1995; J. Alg. Combinatorics 6 (1997), 253-257.
R. P. Stanley, Spanning trees of Aztec diamonds, Discrete Math. 157 (1996), 375-388 (Problem 251).
Index entries for sequences related to trees

Cf. A007726, A340166, A340176, A340185, A340352.

Table[4^n * Product[Product[4 - 4*Cos[j*Pi/(2*n)]*Cos[k*Pi/(2*n)], {k, 1, n-1}], {j, 1, 2*n-1}], {n, 0, 10}] // Round (* Vaclav Kotesovec, Jan 05 2021 *)

default(realprecision, 120);
{a(n) = if(n==0, 1, round(4^(2*(n-1)*n+1)*prod(j=1, n-1, prod(k=1, n-1, 1-(sin(j*Pi/(2*n))*sin(k*Pi/(2*n)))^2))))} \\ Seiichi Manyama, Jan 05 2021

a(n) ~ Gamma(1/4) * exp(8*G*n^2/Pi) / (Pi^(3/4) * sqrt(n) * 4^n), where G is Catalan's constant A006752. - Vaclav Kotesovec, Jan 05 2021

a(n) = 4^(2*n-1) * Product_{1<=j,k<=n-1} (4 - 4*cos(j*Pi/(2*n))*cos(k*Pi/(2*n)))*(4 + 4*cos(j*Pi/(2*n))*cos(k*Pi/(2*n))); [Knuth Eq. (8) p. 3]. - Seiichi Manyama, Jan 05 2021

More terms from Alois P. Heinz, Jan 20 2011

Offset changed (a(0)=1) by Seiichi Manyama, Jan 05 2021

A340185 Number of spanning trees in the halved Aztec diamond HOD_n.

Original entry on oeis.org

1, 1, 15, 2639, 5100561, 105518291153, 23067254643457375, 52901008815129395889375, 1266973371422697144030728637409, 315937379766837559600972497421046382689, 818563964325891485548944567913851815851212484079

Offset: 0

Seiichi Manyama, Dec 31 2020

nonn

                                              *
                                              |
                      *                   *---*---*
                      |                   |   |   |
      *           *---*---*           *---*---*---*---*
      |           |   |   |           |   |   |   |   |
  *---*---*   *---*---*---*---*   *---*---*---*---*---*---*
    HOD_1           HOD_2                   HOD_3
-------------------------------------------------------------
                  *
                  |
              *---*---*
              |   |   |
          *---*---*---*---*
          |   |   |   |   |
      *---*---*---*---*---*---*
      |   |   |   |   |   |   |
  *---*---*---*---*---*---*---*---*
                HOD_4

Seiichi Manyama, Table of n, a(n) for n = 0..40
Mihai Ciucu, Symmetry classes of spanning trees of Aztec diamonds and perfect matchings of odd squares with a unit hole, arXiv:0710.4500 [math.CO], 2007. See Corollary 3.7.

Cf. A004003, A007725, A007726, A065072, A127605, A340052, A340176 (halved Aztec diamond HMD_n).

Table[4^((n-1)*n) * Product[Product[(1 - Cos[j*Pi/(2*n + 1)]^2*Cos[k*Pi/(2*n + 1)]^2), {k, j+1, n}], {j, 1, n}], {n, 0, 12}] // Round (* Vaclav Kotesovec, Jan 03 2021 *)

default(realprecision, 120);
{a(n) = round(prod(j=1, 2*n, prod(k=j+1, 2*n-j, 4-4*cos(j*Pi/(2*n+1))*cos(k*Pi/(2*n+1)))))}

default(realprecision, 120);
{a(n) = round(4^((n-1)*n)*prod(j=1, n, prod(k=j+1, n, 1-(cos(j*Pi/(2*n+1))*cos(k*Pi/(2*n+1)))^2)))} \\ Seiichi Manyama, Jan 02 2021

# Using graphillion
from graphillion import GraphSet
def make_HOD(n):
    s = 1
    grids = []
    for i in range(2 * n + 1, 1, -2):
        for j in range(i - 2):
            a, b, c = s + j, s + j + 1, s + i + j
            grids.extend([(a, b), (b, c)])
        grids.append((s + i - 2, s + i - 1))
        s += i
    return grids
def A340185(n):
    if n == 0: return 1
    universe = make_HOD(n)
    GraphSet.set_universe(universe)
    spanning_trees = GraphSet.trees(is_spanning=True)
    return spanning_trees.len()
print([A340185(n) for n in range(7)])

a(n) = Product_{1<=j

From Seiichi Manyama, Jan 02 2021: (Start)

a(n) = 4^((n-1)*n) * Product_{1<=j

a(n) = A340052(n) * A065072(n) = (1/2^n) * sqrt(A127605(n) * A004003(n) / (2*n+1)). (End)

a(n) ~ sqrt(Gamma(1/4)) * exp(G*(2*n+1)^2/Pi) / (Pi^(3/8) * n^(3/4) * 2^(n + 3/4) * (1 + sqrt(2))^(n + 1/2)), where G is Catalan's constant A006752. - Vaclav Kotesovec, Jan 03 2021

A229728 Decimal expansion of the square of the constant A130834.

Original entry on oeis.org

3, 2, 0, 9, 9, 1, 2, 3, 0, 0, 7, 2, 8, 1, 5, 7, 6, 7, 8, 6, 2, 9, 7, 4, 9, 4, 8, 1, 7, 7, 9, 9, 0, 5, 1, 5, 8, 7, 4, 8, 5, 9, 2, 1, 2, 4, 2, 5, 1, 8, 3, 4, 4, 9, 4, 8, 7, 4, 5, 8, 6, 0, 0, 5, 8, 4, 6, 1, 0, 2, 4, 6, 4, 1, 6, 2, 4, 2, 4, 0, 2, 0, 4, 0, 6, 6, 7, 6, 7, 1, 2, 1, 5, 1, 4, 1, 0, 8, 8, 7, 0, 9, 4, 2, 8, 4, 6, 6, 9, 1, 5, 8, 3, 8, 7, 5, 2, 2, 6, 9

Offset: 1

N. J. A. Sloane, Oct 01 2013

			3.209912300728157678629749481779905158748592124251834494874586...

Steven R. Finch, Mathematical Constants, Cambridge, 2003, p. 232.

Cf. A000796, A006752, A097469, A130834.

Cf. A007341, A212800, A334088, A335586, A340139, A340176, A340557, A340562, A341479.

RealDigits[Exp[4*Catalan/Pi], 10, 120][[1]] (* Amiram Eldar, Jun 12 2023 *)

exp(4*Catalan/Pi) \\ Charles R Greathouse IV, Jul 15 2014

From Amiram Eldar, Jun 12 2023: (Start)
Equals exp(4*G/Pi) = exp(4*A006752/A000796).
Equals A097469^4. (End)

Showing 1-3 of 3 results.

cp's OEIS Frontend

A007725 Number of spanning trees of Aztec diamonds of order n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A340185 Number of spanning trees in the halved Aztec diamond HOD_n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Python

Formula

A229728 Decimal expansion of the square of the constant A130834.

Views

Author

Keywords

Examples

References

Crossrefs

Programs

Mathematica

PARI

Formula