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.

A048601 Robbins triangle read by rows: T(n,k) = number of alternating sign n X n matrices with a 1 at top of column k (n >= 1, 1<=k<=n).

Original entry on oeis.org

1, 1, 1, 2, 3, 2, 7, 14, 14, 7, 42, 105, 135, 105, 42, 429, 1287, 2002, 2002, 1287, 429, 7436, 26026, 47320, 56784, 47320, 26026, 7436, 218348, 873392, 1813968, 2519400, 2519400, 1813968, 873392, 218348, 10850216, 48825972, 113927268, 179028564
Offset: 1

Views

Author

Keywords

Comments

An alternating sign matrix is a matrix of 0'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.
Named after the American mathematician David Peter Robbins (1942-2003). - Amiram Eldar, Jun 13 2021

Examples

			Triangle begins:
     1,
     1,     1,
     2,     3,     2,
     7,    14,    14,     7,
    42,   105,   135,   105,    42,
   429,  1287,  2002,  2002,  1287,   429,
  7436, 26026, 47320, 56784, 47320, 26026, 7436,
  ...
		

References

  • David Bressoud, Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture, Cambridge University Press, 1999, p. 5.

Crossrefs

Row sums (also borders) of triangle give A005130. Cf. A051106.
A210697 is a companion triangle.

Programs

  • Maple
    T:=(n,k)-> binomial(n+k-2, k-1)*((2*n-k-1)!/(n-k)!)*product(((3*j+1)!/(n+j)!),j=0..n-2);
  • Mathematica
    t[n_, k_] := Binomial[n+k-2, k-1]*((2*n-k-1)!/(n-k)!)*Product[((3*j+1)!/(n+j)!), {j, 0, n-2}]; Table[t[n, k], {n, 1, 9}, {k, 1, n}] // Flatten (* Jean-François Alcover, Nov 12 2012, from formula *)

Formula

T(n,k) = binomial(n+k-2, k-1)*((2*n-k-1)!/(n-k)!) * product(((3*j+1)!/(n+j)!), j=0..n-2);

Extensions

More terms from James Sellers