A049505 -id:A049505 - cp's OEIS frontend

A008793 The problem of the calissons: number of ways to tile a hexagon of edge n with diamonds of side 1. Also number of plane partitions whose Young diagrams fit inside an n X n X n box.

1, 2, 20, 980, 232848, 267227532, 1478619421136, 39405996318420160, 5055160684040254910720, 3120344782196754906063540800, 9265037718181937012241727284450000, 132307448895406086706107959899799334375000

Offset: 0

Jonas Wallgren

The 3-dimensional analog of A000984. - William Entriken, Aug 06 2013
The largest prime factor of a(n) is the largest prime p < 3*n. Its multiplicity is equal to 3*n-p. This can be proved with the formula of Michel Marcus, for example. - Walter Trump, Feb 11 2023
a(n) is also the number of resonance structures of circumcircum...coronene, where circum is repeated n-2 times where a(1) is the number of resonance structures of benzene (see Gutman et al.). - Yuan Yao, Oct 29 2023

Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 545, also p. 575 line -1 with a=b=c=n.
D. M. Bressoud, Proofs and Confirmations, Camb. Univ. Press, 1999; Eq. (6.8), p. 198. The first printing of Eq. (6.8) is wrong (see A049505 and A005157), but if one changes the limits in the formula (before it is corrected) to {1 <= i <= r, 1 <= j <= r}, one obtains the present sequence. - N. J. A. Sloane, Jun 30 2013
Gordon G. Cash and Jerry Ray Dias, Computation, Properties and Resonance Topology of Benzenoid Monoradicals and Polyradicals and the Eigenvectors Belonging to Their Zero Eigenvalues, J. Math. Chem., 30 (2001), 429-444. [See K, p. 442.]
Sebastien Desreux, Martin Matamala, Ivan Rapaport, Eric Remila, Domino tilings and related models: space of configurations of domains with holes, arXiv:math/0302344, 27 Feb 2003
Anne S. Meeussen, Erdal C. Oguz, Yair Shokef, Martin van Hecke1, Topological defects produce exotic mechanics in complex metamaterials, arXiv preprint 1903.07919, 2019 [See Section "Compatible metamaterials with fully antiferromagnetic interactions" - N. J. A. Sloane, Mar 23 2019]
J. Propp, Enumeration of matchings: problems and progress, pp. 255-291 in L. J. Billera et al., eds, New Perspectives in Algebraic Combinatorics, Cambridge, 1999 (see p. 261).

Seiichi Manyama, Table of n, a(n) for n = 0..54 (terms 0..30 from T. D. Noe)
T. Amdeberhan and V. H. Moll, Arithmetic properties of plane partitions, El. J. Comb. 18 (2) (2011) # P1.
Guy David and Carlos Tomei, The Problem of the Calissons, The American Mathematical Monthly, Vol. 96, No. 5 (May, 1989), pp. 429-431 (3 pages).
P. Di Francesco, P. Zinn-Justin and J.-B. Zuber, Determinant Formulae for some Tiling Problems and Application to Fully Packed Loops, arXiv:math-ph/0410002, 2004.
I. Fischer, Enumeration of rhombus tilings of a hexagon which contain a fixed rhombus in the center, arXiv:math/9906102 [math.CO], 1999.
P. J. Forrester and A. Gamburd, Counting formulas associated with some random matrix averages, arXiv:math/0503002 [math.CO], 2005.
M. Fulmek and C. Krattenthaler, The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis, II, arXiv:math/9909038 [math.CO], 1999.
I. Gutman, S. J. Cyvin, and V. Ivanov-Petrovic, Topological properties of circumcoronenes, Z. Naturforsch., 53a, 1998, 699-703 (see p. 700) - _Emeric Deutsch_, May 14 2018
H. Helfgott and I. M. Gessel, Enumeration of tilings of diamonds and hexagons with defects, arXiv:math/9810143 [math.CO], 1998.
Sam Hopkins and Tri Lai, Plane partitions of shifted double staircase shape, arXiv:2007.05381 [math.CO], 2020. See Table 1 p. 9.
C. Krattenthaler, Advanced Determinant Calculus: A Complement, Linear Algebra Appl. 411 (2005), 68-166; arXiv:math/0503507v2 [math.CO], 2005.
P. A. MacMahon, Combinatory Analysis, vol. 2, Cambridge University Press, 1916; reprinted by Chelsea, New York, 1960.
Anne S. Meeussen, Erdal C. Oguz, Yair Shokef, and Martin van Hecke, Topological defects produce exotic mechanics in complex metamaterials, arXiv:1903.07919 [cond-mat.soft], 2019.
James Propp, Enumeration of matchings: problems and progress, in L. J. Billera et al. (eds.), New Perspectives in Algebraic Combinatorics
James Propp, Updated article
James Propp, Tiling Problems, Old and New, Rutgers University Math Colloquium, March 30, 2022
N. C. Saldanha and C. Tomei, An overview of domino and lozenge tilings, arXiv:math/9801111 [math.CO], 1998.
P. J. Taylor, Counting distinct dimer hex tilings, Preprint, 2015.
Walter Trump, Prime factorization of a(n) for 1..950
Eric Weisstein's World of Mathematics, Plane Partition.

Cf. A000984, A066931, A352656, A352657. Main diagonal of array A103905.

A008793 := proc(n) local i; mul((i - 1)!*(i + 2*n - 1)!/((i + n - 1)!)^2, i = 1 .. n) end proc;

Table[ Product[ (i+j+k-1)/(i+j+k-2), {i, n}, {j, n}, {k, n} ], {n, 10} ]

a(n) = prod(i=1,n, prod(j=1, n, (n+i+j-1)/(i+j-1))); \\ Michel Marcus, Jul 13 2020

a(n) = Product_{i = 0..n-1} (i^(-i)*(n+i)^(2*i-n)*(2*n+i)^(n-i)).
a(n) = Product_{i = 1..n} Product_{j = 0..n-1} (3*n-i-j)/(2*n-i-j).
a(n) = Product_{i = 1..n} Gamma[i]*Gamma[i+2*n]/Gamma[i+n]^2.
a(n) = Product_{i = 0..n-1} i!*(i+2*n)!/(i+n)!^2.
a(n) = Product_{i = 1..n} Product_{j = n..2*n-1} i+j / Product_{j = 0..n-1} i+j. - Paul Barry, Jun 13 2006
For n >= 1, a(n) = det(binomial(2*n,n+i-j)) for 1<=i,j<=n [Krattenhaller, Theorem 4, with a = b = c = n].
Let H(n) = Product_{k = 1..n-1} k!. Then for a,b,c nonnegative integers (H(a)*H(b)*H(c)*H(a+b+c))/(H(a+b)*H(b+c)*H(c+a)) is an integer [MacMahon, Chapter II, Section 429, p. 182, with x -> 1]. Setting a = b = c = n gives the entries for this sequence. - Peter Bala, Dec 22 2011
a(n) ~ exp(1/12) * 3^(9*n^2/2 - 1/12) / (A * n^(1/12) * 2^(6*n^2 - 1/4)), where A = A074962 = 1.28242712910062263687534256886979... is the Glaisher-Kinkelin constant. - Vaclav Kotesovec, Feb 27 2015
a(n) = Product_{i = 1..n} Product_{j = 1..n} (n+i+j-1)/(i+j-1). - Michel Marcus, Jul 13 2020
Conjecture: the supercongruences a(n*p^r) == a(n*p^(r-1))^p (mod p^(4*r)) hold for all primes p and positive integers n and r. - Peter Bala, Apr 07 2022

More terms from Eric W. Weisstein

A005157 Number of totally symmetric plane partitions that fit in an n X n X n box.

Original entry on oeis.org

1, 2, 5, 16, 66, 352, 2431, 21760, 252586, 3803648, 74327145, 1885102080, 62062015500, 2652584509440, 147198472495020, 10606175914819584, 992340657705109416, 120567366227960791040, 19023173201224270401428, 3897937005297330777227264

Offset: 0

N. J. A. Sloane

Also, number of 2-dimensional shifted complexes on n+1 nodes. [Klivans]
Also the number of totally symmetric partitions which fit in an (n-1)-dimensional box with side length 4 (for n>0). - Graham H. Hawkes, Jan 11 2014
Suppose we index this sequence slightly differently. Let the elements of a partition be represented by points rather than boxes, as in a Ferrers diagram. In this case, a 1 X 1 X 1 (closed) box would fit 8 points -- one at each vertex of the box, and we use the convention that a 0 X 0 X 0 (closed) box contains exactly one point. Using this indexing, the sequence begins (offset is still 0) 2,5,16,... rather than 1,2,5,... If we use the same method of indexing for all other dimensions, then we have the following remarkable result: The number of totally symmetric partitions which fit inside a d-dimensional box with side length n is equal to the number of totally symmetric partitions which fit inside an n-dimensional box of side length d. - Graham H. Hawkes, Jan 11 2014
For two other contexts where this sequence arises, see the Knuth (2019) link (noncrossing paths among the 2(2^n-1) paths defined in that note; independent sets of paths among the first 2^n-1 of those). - N. J. A. Sloane, Feb 09 2019, based on email from Don Knuth.

			a(2) = 5 because we have: void, 1, 21/1, 22/21, and 22/22.

D. M. Bressoud, Proofs and Confirmations, Camb. Univ. Press, 1999; Eq. (6.8), p. 198 (corrected).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Alois P. Heinz, Table of n, a(n) for n = 0..130 (first 51 terms from T. D. Noe)
Paul Barry, Centered polygon numbers, heptagons and nonagons, and the Robbins numbers, arXiv:2104.01644 [math.CO], 2021.
R. K. Guy, Letter to N. J. A. Sloane, Dec 5 1988.
Graham H. Hawkes, Totally symmetric partitions in boxes
Seth Ireland, A bijection between strongly stable and totally symmetric partitions, arXiv:2302.02505 [math.CO], 2023.
C. Klivans, Obstructions to shiftedness, preprint.
C. Klivans, Obstructions to shiftedness, Discrete Comput. Geom., 33 (2005), 535-545.
Don Knuth, A conjecture about noncrossing paths, Feb 06 2019.
R. P. Stanley, A baker's dozen of conjectures concerning plane partitions, pp. 285-293 of "Combinatoire Enumerative (Montreal 1985)", Lect. Notes Math. 1234, 1986.
R. P. Stanley, A baker's dozen of conjectures concerning plane partitions, pp. 285-293 of "Combinatoire Enumerative (Montreal 1985)", Lect. Notes Math. 1234, 1986. Preprint. [Annotated scanned copy]

Cf. A049505, A184173, A323848.

Row sums of A214564.

A005157 := proc(n) local i,j; mul(mul((i+j+n-1)/(i+2*j-2),j=i..n),i=1..n); end;

Table[Product[(i+j+k-1)/(i+j+k-2),{i,n},{j,i,n},{k,j,n}],{n,0,20}] (* Harvey P. Dale, Jul 17 2011 *)

A005157(n)=prod(i=1,n,prod(j=i,n,(i+j+n-1)/(i+2*j-2))) \\ M. F. Hasler, Sep 26 2018

a(n) = Product_{i=1..n} Product_{j=i..n} Product_{k=j..n} (i+j+k-1)/(i+j+k-2). - Paul Barry, May 13 2008
a(n) ~ exp(1/72) * GAMMA(1/3)^(2/3) * n^(7/72) * 3^(3*n*(n+1)/4 + 11/72) / (A^(1/6) * Pi^(1/3) * 2^(n*(2*n+1)/2 + 13/24)), where A = A074962 = 1.2824271291... is the Glaisher-Kinkelin constant. - Vaclav Kotesovec, Mar 01 2015
a(n) = sqrt(A323848(n+1,n)) for n >= 1. [proof by Nikolai Beluhov; see Knuth (2019) link] - Alois P. Heinz, Feb 10 2019
Apparently, a(n) = Sum_{k=0..n} A184173(n,k). - Alois P. Heinz, Feb 11 2019
Conjectures: if p == 1 (mod 6) is prime then a(p) == 2^((p+5)/6) (mod p^2); if p == 5 (mod 6) is prime then a(p) == 2^((p+1)/6) (mod p^2) (checked up to p = 1009). - Peter Bala, Feb 17 2023

A073165 Triangle T(n,k) read by rows: related to David G. Cantor's sigma function.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 4, 1, 1, 4, 10, 8, 1, 1, 5, 20, 35, 16, 1, 1, 6, 35, 112, 126, 32, 1, 1, 7, 56, 294, 672, 462, 64, 1, 1, 8, 84, 672, 2772, 4224, 1716, 128, 1, 1, 9, 120, 1386, 9504, 28314, 27456, 6435, 256, 1, 1, 10, 165, 2640, 28314, 151008, 306735, 183040, 24310, 512, 1

Offset: 0

Michael Somos, Jul 24 2002

Square array T(n+k,k) read by antidiagonals: number of stars of length k with n branches.

Row n of T(n+k,k) has g.f. (floor(n/2)+1)F(floor(n/2))(1,3/2,5/2,...,(2*floor(n/2)+1)/2;n,n-1,...,n-floor(n/2)+1;2^n*x) (conjecture). [Paul Barry, Jan 23 2009]

			Triangle rows:
  1;
  1, 1;
  1, 2,  1;
  1, 3,  4,   1;
  1, 4, 10,   8,    1;
  1, 5, 20,  35,   16,    1;
  1, 6, 35, 112,  126,   32,    1;
  1, 7, 56, 294,  672,  462,   64,   1;
  1, 8, 84, 672, 2772, 4224, 1716, 128, 1;

Seiichi Manyama, Rows n = 0..139, flattened
D. G. Cantor, On the analogue of the division polynomials for hyperelliptic curves, J. Reine Angew. Math. (Crelle's J.) 447 (1994), pp. 91-145.
C. Krattenthaler, A. J. Guttmann and X. G. Viennot, Vicious walkers, friendly walkers and Young tableaux, II: with a wall, arXiv:cond-mat/0006367 [cond-mat.stat-mech], 2000.

Square array has main diagonal A049505, columns include A001700, A003645, A000356.

Cf. A133112.

t[n_, k_] := Product[ (n-k+i+j-1) / (i+j-1), {j, 1, k}, {i, 1, j}]; Flatten[ Table[t[n, k], {n, 0, 10}, {k, 0, n}]] (* Jean-François Alcover, May 23 2012, after PARI *)

{T(n, k) = if( k<0 || k>n, 0, prod( i=1, (k+1)\2, binomial(n + 2*i - 1 - k%2, 4*i - 1 - k%2*2)) / prod( i=0, (k-1)\2, binomial(2*k - 2*i - 1, 2*i)))}

{T(n, k) = if( k<0 || n<0, 0, prod( j=1, k, prod( i=1, j, (n - k + i + j - 1) / (i + j - 1) )))} /* Michael Somos, Oct 16 2006 */

T(n, k) * T(n-2, k-1) - 2 * T(n-1, k-1) * T(n-1, k) + T(n, k-1) * T(n-2, k) = 0.

T(n+k, k) = Product_{1<=i<=j<=k} (n+i+j-1)/(i+j-1). - Ralf Stephan, Mar 02 2005

Edited by Ralf Stephan, Mar 02 2005

A102539 Square array T(n,k) read by antidiagonals: T(n,k) = Product_{1<=i<=j<=k} (n+i+j-1)/(i+j-1).

Original entry on oeis.org

2, 3, 4, 4, 10, 8, 5, 20, 35, 16, 6, 35, 112, 126, 32, 7, 56, 294, 672, 462, 64, 8, 84, 672, 2772, 4224, 1716, 128, 9, 120, 1386, 9504, 28314, 27456, 6435, 256, 10, 165, 2640, 28314, 151008, 306735, 183040, 24310, 512, 11, 220, 4719, 75504, 674817

Offset: 1

Ralf Stephan, Jan 14 2005

Number of semistandard Young tableaux with at most n columns and with entries in [k].

T(n,k) is the number of k X k symmetric matrices with entries in 0..n with each row (and column) in nondecreasing order. - R. H. Hardin, Jul 08 2008

			Square array T(n,k) begins:
  2,  4,    8,    16,     32,       64, ...
  3, 10,   35,   126,    462,     1716, ...
  4, 20,  112,   672,   4224,    27456, ...
  5, 35,  294,  2772,  28314,   306735, ...
  6, 56,  672,  9504, 151008,  2617472, ...
  7, 84, 1386, 28314, 674817, 18076916, ...
  ...

M. Lederer, A determinant-like formula for the Kostka numbers

Rows include A000079, A001700, A003645, A000356.

Main diagonal is A049505.

T[n_, k_] := Product[(n + i + j - 1)/(i + j - 1), {i, 1, k}, {j, i, k}];
Table[T[n - k + 1, k], {n, 1, 10}, {k, 1, n}] // Flatten (* Jean-François Alcover, Nov 06 2018 *)

It appears that T is identical to the reflected triangle A073165, i.e. T(n, k) = Prod[i=1..floor((k+1)/2), C(n+k+2i-1-(k mod 2), 4i-1-2(k mod 2))] / Prod[i=0..floor((k-1)/2), C(2k-2i-1, 2i)].

cp's OEIS Frontend

A008793 The problem of the calissons: number of ways to tile a hexagon of edge n with diamonds of side 1. Also number of plane partitions whose Young diagrams fit inside an n X n X n box.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A005157 Number of totally symmetric plane partitions that fit in an n X n X n box.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A073165 Triangle T(n,k) read by rows: related to David G. Cantor's sigma function.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A102539 Square array T(n,k) read by antidiagonals: T(n,k) = Product_{1<=i<=j<=k} (n+i+j-1)/(i+j-1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A066931 Number of ways to tile hexagon of edge n with diamonds of side 1, not counting rotations and reflections as different.

Views

Author

Keywords

Links

Crossrefs

Formula

Extensions