|
| |
|
|
A005130
|
|
Robbins numbers: a(n) = Product_{k=0..n-1} (3k+1)!/(n+k)!; also the number of descending plane partitions whose parts do not exceed n; also the number of n X n alternating sign matrices (ASM's).
(Formerly M1808)
|
|
45
|
|
|
|
1, 1, 2, 7, 42, 429, 7436, 218348, 10850216, 911835460, 129534272700, 31095744852375, 12611311859677500, 8639383518297652500, 9995541355448167482000, 19529076234661277104897200, 64427185703425689356896743840, 358869201916137601447486156417296
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,3
|
|
|
COMMENTS
|
Also known as the Andrews-Mills-Robbins-Rumsey numbers. - N. J. A. Sloane, May 24 2013
An alternating sign matrix is a matrix of 0's, 1's and -1's such that (a) the sum of each row and column is 1; (b) the nonzero entries in each row and column alternate in sign.
From Gary W. Adamson, May 27 2009: (Start)
Starting with offset 1 = row sums of triangle A160708, and convolution square of A160707.
a(n) is odd iff n is a Jacobsthal number [Frey and Sellers, 2000].
Starting with offset 1 = row sums of triangle A160708.
Starting (1, 2, 7,...) = convolution square of A160707: [1, 1, 3, 18, 192,...].
(End)
|
|
|
REFERENCES
|
D. M. Bressoud, Proofs and Confirmations, Camb. Univ. Press, 1999; A_n on page 4, D_r on page 197.
C. Pickover, Mazes for the Mind, St. Martin's Press, NY, 1992, Chapter 75, pp. 385-386.
C. A. Pickover, Wonders of Numbers, "Princeton Numbers", Chapter 83, Oxford Univ. Press NY 2001.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n = 0..100
T. Amdeberhan, V. H. Moll, Arithmetic properties of plane partitions, El. J. Comb. 18 (2) (2011) # P1.
G. E. Andrews, Plane partitions (III): the Weak Macdonald Conjecture, Invent. Math., 53 (1979), 193-225. (See Theorem 10.)
Paul Barry, Jacobsthal Decompositions of Pascal's Triangle, Ternary Trees, and Alternating Sign Matrices, Journal of Integer Sequences, 19, 2016, #16.3.5.
M. T. Batchelor, J. de Gier and B. Nienhuis, The quantum symmetric XXZ chain at Delta=-1/2, alternating sign matrices and plane partitions, arXiv:cond-mat/0101385 [cond-mat.stat-mech], 2001.
E. Beyerstedt, V. H. Moll, X. Sun, The p-adic Valuation of the ASM Numbers, J. Int. Seq. 14 (2011) # 11.8.7
D. M. Bressoud and J. Propp, How the alternating sign matrix conjecture was solved, Notices Amer. Math. Soc., 46 (No. 6, 1999), 637-646.
H. Cheballah, S. Giraudo, R. Maurice, Combinatorial Hopf algebra structure on packed square matrices, arXiv preprint arXiv:1306.6605 [math.CO], 2013-2015.
M. Ciucu, The equivalence between enumerating cyclically symmetric, self-complementary and totally symmetric, self-complementary plane partitions, J. Combin. Theory Ser. A 86 (1999), 382-389.
F. Colomo and A. G. Pronko, On the refined 3-enumeration of alternating sign matrices, Advances in Applied Mathematics 34 (2005) 798.
F. Colomo and A. G. Pronko, Square ice, alternating sign matrices and classical orthogonal polynomials, JSTAT (2005) P01005.
G. Conant, Magmas and Magog Triangles, 2014.
FindStat - Combinatorial Statistic Finder, Alternating sign matrices
I. Fischer, The number of monotone triangles with prescribed bottom row, arXiv:math/0501102 [math.CO], 2005.
T. Fonseca, F. Balogh, The higher spin generalization of the 6-vertex model with domain wall boundary conditions and Macdonald polynomials, Journal of Algebraic Combinatorics, 2014, arXiv:1210.4527
P. Di Francesco, A refined Razumov-Stroganov conjecture II, arXiv:cond-mat/0409576 [cond-mat.stat-mech], 2004.
P. Di Francesco, P. Zinn-Justin and J.-B. Zuber, Determinant formulas for some tiling problems..., arXiv:math-ph/0410002, 2004.
D. D. Frey and J. A. Sellers, Jacobsthal Numbers and Alternating Sign Matrices, Journal of Integer Sequences Vol. 3 (2000) #00.2.3.
D. D. Frey and J. A. Sellers, Prime Power Divisors of the Number of n X n Alternating Sign Matrices
M. Gardner, Letter to N. J. A. Sloane, Jun 20 1991.
J. de Gier, Loops, matchings and alternating-sign matrices, arXiv:math/0211285 [math.CO], 2002-2003.
C. Heuberger, H. Prodinger, A precise description of the p-adic valuation of the number of alternating sign matrices, Intl. J. Numb. Th. 7 (1) (2011) 57-69
Heuer, Dylan, Chelsey Morrow, Ben Noteboom, Sara Solhjem, Jessica Striker, and Corey Vorland. "Chained permutations and alternating sign matrices - Inspired by three-person chess." Discrete Mathematics 340, no. 12 (2017): 2732-2752. Also arXiv:1611.03387.
G. Kuperberg, Another proof of the alternating-sign matrix conjecture, Internat. Math. Res. Notices, No. 3, (1996), 139-150.
G. Kuperberg, Symmetry classes of alternating-sign matrices under one roof, arXiv math.CO/0008184, Ann. Math. 156 (3) (2002) 835-866
W. H. Mills, David P Robbins, Howard Rumsey Jr., Alternating sign matrices and descending plane partitions J. Combin. Theory Ser. A 34 (1983), no. 3, 340--359. MR0700040 (85b:05013)
Igor Pak, Complexity problems in enumerative combinatorics, arXiv:1803.06636 [math.CO], 2018.
C. Pickover, Mazes for the Mind, St. Martin's Press, NY, 1992, Chapter 75, pp. 385-386. [Annotated scanned copy]
J. Propp, The many faces of alternating-sign matrices.
A. V. Razumov and Yu. G. Stroganov, Spin chains and combinatorics, arXiv cond-mat/0012141
Lukas Riegler, Simple enumeration formulas related to Alternating Sign Monotone Triangles and standard Young tableaux, Dissertation, Universitat Wien, 2014.
D. P. Robbins, The story of 1, 2, 7, 42, 429, 7436, ..., Math. Intellig., 13 (No. 2, 1991), 12-19.
D. P. Robbins, Symmetry classes of alternating sign matrices, arXiv:math/0008045 [math.CO], 2000.
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]
Yu. G. Stroganov, 3-enumerated alternating sign matrices
X. Sun, V. H. Moll, The p-adic Valuations of Sequences Counting Alternating Sign Matrices, JIS 12 (2009) 09.3.8
Eric Weisstein's World of Mathematics, Alternating Sign Matrix
Eric Weisstein's World of Mathematics, Descending Plane Partition
D. Zeilberger, Proof of the alternating-sign matrix conjecture, arXiv:math/9407211 [math.CO], 1994.
D. Zeilberger, Proof of the alternating-sign matrix conjecture, Elec. J. Combin., Vol. 3 (Number 2) (1996), #R13.
D. Zeilberger, Proof of the Refined Alternating Sign Matrix Conjecture, arXiv:math/9606224 [math.CO], 1996.
D. Zeilberger, A constant term identity featuring the ubiquitous(and mysterious)Andrews-Mills-Robbins-Ramsey numbers 1,2,7,42,429,..., J. Combin. Theory, A 66 (1994), 17-27.
D. Zeilberger, Dave Robbins's Art of Guessing, Adv. in Appl. Math. 34 (2005), 939-954.
Index entries for sequences related to factorial numbers
Index entries for "core" sequences
|
|
|
FORMULA
|
a(n) = Product_{k=0..n-1} (3k+1)!/(n+k)!.
The Hankel transform of A025748 is a(n) * 3^binomial(n, 2). - Michael Somos, Aug 30 2003
a(n) = sqrt(A049503).
From Bill Gosper, Mar 11 2014: (Start)
A "Stirling's formula" for this sequence is
a(n) ~ 3^(5/36+(3/2)*n^2)/(2^(1/4+2*n^2)*n^(5/36))*(exp(zeta'(-1))*gamma(2/3)^2/Pi)^(1/3).
which gives results which are very close to the true values:
1.0063254118710128, 2.003523267231662,
7.0056223910285915, 42.01915917750558,
429.12582410098327, 7437.518404899576,
218380.8077275304, 1.085146545456063*^7,
9.119184824937415*^8
(End)
a(n+1) = a(n) * n! * (3*n+1)! / ((2*n)! * (2*n+1)!). - Reinhard Zumkeller, Sep 30 2014; corrected by Eric W. Weisstein, Nov 08 2016
|
|
|
EXAMPLE
|
G.f. = 1 + x + 2*x^2 + 7*x^3 + 42*x^4 + 429*x^5 + 7436*x^6 + 218348*x^7 + ...
|
|
|
MAPLE
|
A005130 := proc(n) local k; mul((3*k+1)!/(n+k)!, k=0..n-1); end;
# Bill Gosper's approximation (for n>0):
a_prox := n -> (2^(5/12-2*n^2)*3^(-7/36+1/2*(3*n^2))*exp(1/3*Zeta(1, -1))*Pi^(1/3)) /(n^(5/36)*GAMMA(1/3)^(2/3)); # Peter Luschny, Aug 14 2014
|
|
|
MATHEMATICA
|
f[n_] := Product[(3k + 1)!/(n + k)!, {k, 0, n - 1}]; Table[ f[n], {n, 0, 17}] (* Robert G. Wilson v, Jul 15 2004 *)
a[ n_] := If[ n < 0, 0, Product[(3 k + 1)! / (n + k)!, {k, 0, n - 1}]]; (* Michael Somos, May 06 2015 *)
|
|
|
PROG
|
(PARI) {a(n) = if( n<0, 0, prod(k=0, n-1, (3*k + 1)! / (n + k)!))}; /* Michael Somos, Aug 30 2003 */
(PARI) {a(n) = my(A); if( n<0, 0, A = Vec( (1 - (1 - 9*x + O(x^(2*n)))^(1/3)) / (3*x)); matdet( matrix(n, n, i, j, A[i+j-1])) / 3^binomial(n, 2))}; /* Michael Somos, Aug 30 2003 */
|
|
|
CROSSREFS
|
Cf. A006366, A048601, also A003827, A005156, A005158, A005160-A005164, A050204, A049503, A160707, A160708, A194827, A227833.
Sequence in context: A066383 A011802 A007065 * A091669 A108042 A152559
Adjacent sequences: A005127 A005128 A005129 * A005131 A005132 A005133
|
|
|
KEYWORD
|
nonn,easy,nice,core
|
|
|
AUTHOR
|
N. J. A. Sloane
|
|
|
STATUS
|
approved
|
| |
|
|
