A230880 -id:A230880 - cp's OEIS frontend

A230878 Irregular triangle read by rows: T(n,k) = number of 2-packed n X n matrices with exactly k nonzero entries (0 <= k <= n^2).

1, 0, 2, 0, 0, 8, 32, 16, 0, 0, 0, 48, 720, 2880, 4992, 4608, 2304, 512, 0, 0, 0, 0, 384, 13824, 143872, 739328, 2320896, 4964352, 7659520, 8749056, 7421952, 4587520, 1966080, 524288, 65536, 0, 0, 0, 0, 0, 3840, 268800, 5504000, 57068800, 372416000

Offset: 0

N. J. A. Sloane, Nov 09 2013

A k-packed matrix of size n X n is a matrix with entries in the alphabet A_k = {0,1, ..., k} such that each row and each column contains at least one nonzero entry.

			Triangle begins:
1
0 2
0 0 8 32 16
0 0 0 48 720 2880 4992 4608 2304 512
...

Andrew Howroyd, Table of n, a(n) for n = 0..662 (rows 0..12 flattened)
H. Cheballah, S. Giraudo, R. Maurice, Combinatorial Hopf algebra structure on packed square matrices, arXiv preprint arXiv:1306.6605 [math.CO], 2013.

Row sums are A230879.
Column sums are A230880.
Cf. A000165, A055599.

p[k_, n_, l_] := Sum[(-1)^(i+j)*Binomial[n, i]*Binomial[n,j]*Binomial[i*j, l]*k^l, {i, 0, n}, {j, 0, n}];
T[n_, k_] := p[2, n, k];
Table[T[n, k], {n, 0, 5}, {k, 0, n^2}] // Flatten (* Jean-François Alcover, Oct 08 2017, translated from PARI *)

\\ T(n,k) = p(2,n,k) (see Cheballah et al. ref).
p(k,n,l) = {sum(i=0, n, sum(j=0, n, (-1)^(i+j) * binomial(n,i) * binomial(n,j) * binomial(i*j,l) * k^l))}
for (n=0,5, for(k=0,n^2, print1(p(2,n,k), ", ")); print); \\ Andrew Howroyd, Sep 20 2017

From Andrew Howroyd, Sep 20 2017: (Start)
T(n, k) = Sum_{i=0..n} Sum_{j=0..n} (-1)^(i+j) * binomial(n,i) * binomial(n,j) * binomial(i*j,k) * 2^k.
T(n, k) = 0 for n > k.
T(n, n) = A000165(n).
(End)

Terms a(18) and beyond from Andrew Howroyd, Sep 20 2017

A230879 Number of 2-packed n X n matrices.

Original entry on oeis.org

1, 2, 56, 16064, 39156608, 813732073472, 147662286695991296, 237776857718965784182784, 3425329990022686416530808209408, 443021337239562368918979788606843912192, 515203019085226443540506018909263027730003787776

Offset: 0

N. J. A. Sloane, Nov 09 2013

nonn

A k-packed matrix of size n X n is a matrix with entries in the alphabet A_k = {0,1, ..., k} such that each row and each column contains at least one nonzero entry.

Andrew Howroyd, Table of n, a(n) for n = 0..30
H. Cheballah, S. Giraudo, R. Maurice, Combinatorial Hopf algebra structure on packed square matrices, arXiv preprint arXiv:1306.6605 [math.CO], 2013.

Row sums of A230878.

Cf. A048291, A055599, A230880, A104602.

p[k_, n_] := Sum[(-1)^(i + j)*Binomial[n, i]*Binomial[n, j]*(k + 1)^(i*j), {i, 0, n}, {j, 0, n}];
a[n_] := p[2, n];
Table[a[n], {n, 0, 10}] (* Jean-François Alcover, Oct 08 2017, translated from PARI *)

\\ here p(k,n) is number of k-packed matrices of size n.
p(k,n)={sum(i=0, n, sum(j=0, n, (-1)^(i+j) * binomial(n,i) * binomial(n,j) * (k+1)^(i*j)))}
a(n) = p(2,n); \\ Andrew Howroyd, Sep 20 2017

Cheballah et al. give an explicit formula.

a(n) = Sum_{i=0..n} Sum_{j=0..n} (-1)^(i+j) * binomial(n,i) * binomial(n,j) * 3^(i*j). - Andrew Howroyd, Sep 20 2017

Terms a(7) and beyond from Andrew Howroyd, Sep 20 2017

cp's OEIS Frontend

A230878 Irregular triangle read by rows: T(n,k) = number of 2-packed n X n matrices with exactly k nonzero entries (0 <= k <= n^2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions