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.

Showing 1-10 of 10 results.

A331315 Array read by antidiagonals: A(n,k) is the number of nonnegative integer matrices with k columns and any number of nonzero rows with column sums n and columns in nonincreasing lexicographic order.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 4, 14, 4, 1, 1, 8, 150, 128, 8, 1, 1, 16, 2210, 10848, 1288, 16, 1, 1, 32, 41642, 1796408, 933448, 13472, 32, 1, 1, 64, 956878, 491544512, 1852183128, 85862144, 143840, 64, 1, 1, 128, 25955630, 200901557728, 7805700498776, 2098614254048, 8206774496, 1556480, 128, 1
Offset: 0

Views

Author

Andrew Howroyd, Jan 13 2020

Keywords

Comments

The condition that the columns be in nonincreasing order is equivalent to considering nonequivalent matrices up to permutation of columns.
A(n,k) is the number of n-uniform k-block multisets of multisets.

Examples

			Array begins:
====================================================================
n\k | 0  1      2          3                4                  5
----+---------------------------------------------------------------
  0 | 1  1      1          1                1                  1 ...
  1 | 1  1      2          4                8                 16 ...
  2 | 1  2     14        150             2210              41642 ...
  3 | 1  4    128      10848          1796408          491544512 ...
  4 | 1  8   1288     933448       1852183128      7805700498776 ...
  5 | 1 16  13472   85862144    2098614254048 140102945876710912 ...
  6 | 1 32 143840 8206774496 2516804131997152 ...
     ...
The A(2,2) = 14 matrices are:
  [1 0]  [1 0]  [1 0]  [2 0]  [1 1]  [1 0]  [1 0]
  [1 0]  [0 1]  [0 1]  [0 1]  [1 0]  [1 1]  [1 0]
  [0 1]  [1 0]  [0 1]  [0 1]  [0 1]  [0 1]  [0 2]
  [0 1]  [0 1]  [1 0]
.
  [1 0]  [1 0]  [2 1]  [2 0]  [1 1]  [1 0]  [2 2]
  [0 2]  [0 1]  [0 1]  [0 2]  [1 1]  [1 2]
  [1 0]  [1 1]

Links

Crossrefs

Rows n=1..2 are A000012, A121227.
Columns k=0..2 are A000012, A011782, A331397.
The version with binary entries is A330942.
The version with distinct columns is A331278.
Other variations considering distinct rows and columns and equivalence under different combinations of permutations of rows and columns are:
All solutions: A316674 (all), A331568 (distinct rows).
Up to row permutation: A219727, A219585, A331161, A331160.
Up to column permutation: this sequence, A331572, A331278, A331570.
Nonisomorphic: A331485.
Cf. A317583.

Programs

  • PARI
    T(n, k)={my(m=n*k); sum(j=0, m, binomial(binomial(j+n-1, n)+k-1, k)*sum(i=j, m, (-1)^(i-j)*binomial(i, j)))}

Formula

A(n,k) = Sum_{j=0..n*k} binomial(binomial(j+n-1,n)+k-1, k) * (Sum_{i=j..n*k} (-1)^(i-j)*binomial(i,j)).
A(n, k) = Sum_{j=0..k} abs(Stirling1(k, j))*A316674(n, j)/k!.
A(n, k) = Sum_{j=0..k} binomial(k-1, k-j)*A331278(n, j).
A(n, k) = A011782(n) * A330942(n, k) for k > 0.
A317583(n) = Sum_{d|n} A(n/d, d).

A331571 Array read by antidiagonals: A(n,k) is the number of binary matrices with k columns and any number of distinct nonzero rows with n ones in every column and columns in nonincreasing lexicographic order.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 4, 3, 0, 1, 1, 8, 23, 0, 0, 1, 1, 16, 290, 184, 0, 0, 1, 1, 32, 4298, 17488, 840, 0, 0, 1, 1, 64, 79143, 2780752, 771305, 0, 0, 0, 1, 1, 128, 1702923, 689187720, 1496866413, 21770070, 0, 0, 0, 1, 1, 256, 42299820, 236477490418, 5261551562405, 585897733896, 328149360, 0, 0, 0, 1
Offset: 0

Views

Author

Andrew Howroyd, Jan 20 2020

Keywords

Comments

The condition that the columns be in nonincreasing order is equivalent to considering nonequivalent matrices up to permutation of columns.

Examples

			Array begins:
===============================================================
n\k | 0 1 2   3         4               5                 6
----+----------------------------------------------------------
  0 | 1 1 1   1         1               1                 1 ...
  1 | 1 1 2   4         8              16                32 ...
  2 | 1 0 3  23       290            4298             79143 ...
  3 | 1 0 0 184     17488         2780752         689187720 ...
  4 | 1 0 0 840    771305      1496866413     5261551562405 ...
  5 | 1 0 0   0  21770070    585897733896 30607728081550686 ...
  6 | 1 0 0   0 328149360 161088785679360 ...
  ...
The A(2,2) = 3 matrices are:
   [1 1]  [1 0]  [1 0]
   [1 0]  [1 1]  [0 1]
   [0 1]  [0 1]  [1 1]

Links

Crossrefs

Rows n=0..4 are A000012, A011782, A060090, A060491, A331652.
Cf. A330942, A331567, A331569, A331570, A331572, A331653.

Programs

  • PARI
    WeighT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, (-1)^(n-1)/n))))-1, -#v)}
D(p, n, k)={my(v=vector(n)); for(i=1, #p, v[p[i]]++); binomial(WeighT(v)[n] + k - 1, k)/prod(i=1, #v, i^v[i]*v[i]!)}
T(n, k)={ my(m=n*k+1, q=Vec(exp(intformal(O(x^m) - x^n/(1-x)))), f=Vec(serlaplace(1/(1+x) + O(x*x^m))/(x-1))); if(n==0, 1, sum(j=1, m, my(s=0); forpart(p=j, s+=(-1)^#p*D(p, n, k), [1, n]); s*sum(i=j, m, q[i-j+1]*f[i]))); }

Formula

A(n, k) = Sum_{j=0..k} abs(Stirling1(k, j))*A331567(n, j)/k!.
A(n, k) = Sum_{j=0..k} binomial(k-1, k-j)*A331569(n, j).
A(n, k) = 0 for k > 0, n > 2^(k-1).
A331653(n) = Sum_{d|n} A(n/d, d).

A331569 Array read by antidiagonals: A(n,k) is the number of binary matrices with k distinct columns and any number of distinct nonzero rows with n ones in every column and columns in decreasing lexicographic order.

Original entry on oeis.org

1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 3, 0, 1, 0, 1, 17, 0, 0, 1, 0, 1, 230, 184, 0, 0, 1, 0, 1, 3264, 16936, 840, 0, 0, 1, 0, 1, 60338, 2711904, 768785, 0, 0, 0, 1, 0, 1, 1287062, 675457000, 1493786233, 21770070, 0, 0, 0, 1, 0, 1, 31900620, 232383728378, 5254074934990, 585810653616, 328149360, 0, 0, 0, 1
Offset: 0

Views

Author

Andrew Howroyd, Jan 20 2020

Keywords

Comments

The condition that the columns be in decreasing order is equivalent to considering nonequivalent matrices with distinct columns up to permutation of columns.
A(n,k) is the number of k-block n-uniform T_0 set systems without isolated vertices.

Examples

			Array begins:
===============================================================
n\k | 0 1 2   3         4               5                 6
----+----------------------------------------------------------
  0 | 1 1 0   0         0               0                 0 ...
  1 | 1 1 1   1         1               1                 1 ...
  2 | 1 0 3  17       230            3264             60338 ...
  3 | 1 0 0 184     16936         2711904         675457000 ...
  4 | 1 0 0 840    768785      1493786233     5254074934990 ...
  5 | 1 0 0   0  21770070    585810653616 30604798810581906 ...
  6 | 1 0 0   0 328149360 161087473081920 ...
  ...
The A(2,2) = 3 matrices are:
   [1 1]  [1 0]  [1 0]
   [1 0]  [1 1]  [0 1]
   [0 1]  [0 1]  [1 1]

Links

Crossrefs

Rows n=1..4 are A000012, A331649, A094631, A331650.
Cf. A330942, A331039, A331567, A331570, A331571, A331572, A331651.

Programs

  • PARI
    WeighT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, (-1)^(n-1)/n))))-1, -#v)}
D(p, n, k)={my(v=vector(n)); for(i=1, #p, v[p[i]]++); binomial(WeighT(v)[n], k)/prod(i=1, #v, i^v[i]*v[i]!)}
T(n, k)={ my(m=n*k+1, q=Vec(exp(intformal(O(x^m) - x^n/(1-x)))), f=Vec(serlaplace(1/(1+x) + O(x*x^m))/(x-1))); if(n==0, k<=1, sum(j=1, m, my(s=0); forpart(p=j, s+=(-1)^#p*D(p, n, k), [1, n]); s*sum(i=j, m, q[i-j+1]*f[i]))); }

Formula

A(n, k) = Sum_{j=0..k} Stirling1(k, j)*A331567(n, j)/k!.
A(n, k) = Sum_{j=0..k} (-1)^(k-j)*binomial(k-1, k-j)*A331571(n, j).
A331651(n) = Sum_{d|n} A(n/d, d).

A331572 Array read by antidiagonals: A(n,k) is the number of nonnegative integer matrices with k columns and any number of distinct nonzero rows with column sums n and columns in nonincreasing lexicographic order.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 4, 7, 3, 1, 1, 8, 59, 45, 3, 1, 1, 16, 701, 1987, 271, 5, 1, 1, 32, 10460, 190379, 73567, 1244, 11, 1, 1, 64, 190816, 30474159, 58055460, 2451082, 7289, 13, 1, 1, 128, 4098997, 7287577611, 100171963518, 16557581754, 75511809, 40841, 19, 1
Offset: 0

Views

Author

Andrew Howroyd, Jan 21 2020

Keywords

Comments

The condition that the columns be in nonincreasing order is equivalent to considering nonequivalent matrices up to permutation of columns.

Examples

			Array begins:
==========================================================
n\k | 0  1    2        3             4               5
----+-----------------------------------------------------
  0 | 1  1    1        1             1               1 ...
  1 | 1  1    2        4             8              16 ...
  2 | 1  1    7       59           701           10460 ...
  3 | 1  3   45     1987        190379        30474159 ...
  4 | 1  3  271    73567      58055460    100171963518 ...
  5 | 1  5 1244  2451082   16557581754 311419969572540 ...
  6 | 1 11 7289 75511809 4388702900099 ...
  ...
The A(2,2) = 7 matrices are:
   [1 1]  [1 0]  [1 0]  [2 1]  [2 0]  [1 0]  [2 2]
   [1 0]  [1 1]  [0 1]  [0 1]  [0 2]  [1 2]
   [0 1]  [0 1]  [1 1]

Links

Crossrefs

Rows n=0..3 are A000012, A011782, A331709, A331710.
Columns k=0..3 are A000012, A032020, A331711, A331712.
Cf. A331315, A331568, A331569, A331570, A331571, A331713.

Programs

  • PARI
    EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}
D(p, n, k)={my(v=vector(n)); for(i=1, #p, v[p[i]]++); binomial(EulerT(v)[n] + k - 1, k)/prod(i=1, #v, i^v[i]*v[i]!)}
T(n, k)={ my(m=n*k+1, q=Vec(exp(intformal(O(x^m) - x^n/(1-x)))), f=Vec(serlaplace(1/(1+x) + O(x*x^m))/(x-1))); if(n==0, 1, sum(j=1, m, my(s=0); forpart(p=j, s+=(-1)^#p*D(p, n, k), [1, n]); s*sum(i=j, m, q[i-j+1]*f[i]))); }

Formula

A(n, k) = Sum_{j=0..k} abs(Stirling1(k, j))*A331568(n, j)/k!.
A(n, k) = Sum_{j=0..k} binomial(k-1, k-j)*A331570(n, j).
A331713(n) = Sum_{d|n} A(n/d, d).

A331568 Array read by antidiagonals: A(n,k) is the number of nonnegative integer matrices with k columns and any number of distinct nonzero rows with column sums n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 13, 13, 3, 1, 1, 75, 313, 87, 3, 1, 1, 541, 14797, 11655, 539, 5, 1, 1, 4683, 1095601, 4498191, 439779, 2483, 11, 1, 1, 47293, 119621653, 3611504823, 1390686419, 14699033, 14567, 13, 1, 1, 545835, 17943752233, 5192498314767, 12006713338683, 397293740555, 453027131, 81669, 19, 1
Offset: 0

Views

Author

Andrew Howroyd, Jan 21 2020

Keywords

Examples

			Array begins:
================================================================
n\k | 0  1     2         3               4                 5
----+-----------------------------------------------------------
  0 | 1  1     1         1               1                 1 ...
  1 | 1  1     3        13              75               541 ...
  2 | 1  1    13       313           14797           1095601 ...
  3 | 1  3    87     11655         4498191        3611504823 ...
  4 | 1  3   539    439779      1390686419    12006713338683 ...
  5 | 1  5  2483  14699033    397293740555 37366422896708825 ...
  6 | 1 11 14567 453027131 105326151279287 ...
  ...
The A(2,2) = 13 matrices are:
   [1 1]  [1 1]  [1 0]  [1 0]  [0 1]  [0 1]
   [1 0]  [0 1]  [1 1]  [0 1]  [1 1]  [1 0]
   [0 1]  [1 0]  [0 1]  [1 1]  [1 0]  [1 1]
.
   [2 1]  [2 0]  [1 2]  [1 0]  [0 2]  [0 1]  [2 2]
   [0 1]  [0 2]  [1 0]  [1 2]  [2 0]  [2 1]

Links

Crossrefs

Rows n=0..3 are A000012, A000670, A331644, A331645.
Columns k=0..3 are A000012, A032020, A331646, A331647.
Cf. A219585, A331315, A331567, A331570, A331572, A331648.

Programs

  • PARI
    EulerT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v, n, 1/n))))-1, -#v)}
D(p, n, k)={my(v=vector(n)); for(i=1, #p, v[p[i]]++); EulerT(v)[n]^k/prod(i=1, #v, i^v[i]*v[i]!)}
T(n, k)={ my(m=n*k+1, q=Vec(exp(intformal(O(x^m) - x^n/(1-x)))), f=Vec(serlaplace(1/(1+x) + O(x*x^m))/(x-1))); if(n==0, 1, sum(j=1, m, my(s=0); forpart(p=j, s+=(-1)^#p*D(p, n, k), [1, n]); s*sum(i=j, m, q[i-j+1]*f[i]))); }

Formula

A331648(n) = Sum_{d|n} A(n/d, d).

A331704 Number of nonnegative integer matrices with n distinct columns and any number of distinct nonzero rows with column sums 2 and columns in decreasing lexicographic order.

Original entry on oeis.org

1, 1, 6, 46, 544, 7983, 144970, 3097825, 76494540, 2139610590, 66898897827, 2311748912745, 87494097274959, 3599356204576335, 159917091369687135, 7631292367127171222, 389282192196378927707, 21138914821756778420757, 1217459545430430305769230
Offset: 0

Views

Author

Andrew Howroyd, Jan 25 2020

Keywords

Comments

The condition that the columns be in decreasing order is equivalent to considering nonequivalent matrices with distinct columns up to permutation of columns.

Examples

			The a(2) = 6 matrices are:
   [1 1]  [1 0]  [1 0]  [2 1]  [2 0]  [1 0]
   [1 0]  [1 1]  [0 1]  [0 1]  [0 2]  [1 2]
   [0 1]  [0 1]  [1 1]

Links

Crossrefs

Row n=2 of A331570.
Cf. A331644, A331705.

Formula

a(n) = (1/n!)*Sum_{k=0..n} Stirling1(n, k) * A331644(k).

A331705 Number of nonnegative integer matrices with n distinct columns and any number of distinct nonzero rows with column sums 3 and columns in decreasing lexicographic order.

Original entry on oeis.org

1, 3, 42, 1900, 184550, 29724388, 7137090958, 2393644524156, 1068870144819960, 613045196870306340, 439190550399403297437, 384354189217232125992320, 403475262029493557613389128, 500401167055816780694578266750, 723870101627745660876118985228250
Offset: 0

Views

Author

Andrew Howroyd, Jan 25 2020

Keywords

Comments

The condition that the columns be in decreasing order is equivalent to considering nonequivalent matrices with distinct columns up to permutation of columns.

Examples

			The a(1) = 3 matrices are:
   [2]  [1]  [3]
   [1]  [2]

Links

Crossrefs

Row n=3 of A331570.
Cf. A331645, A331704.

Formula

a(n) = (1/n!)*Sum_{k=0..n} abs(Stirling1(n, k)) * A331645(k).

A331706 Number of nonnegative integer matrices with 2 distinct columns and any number of distinct nonzero rows with column sums n and columns in decreasing lexicographic order.

Original entry on oeis.org

0, 1, 6, 42, 268, 1239, 7278, 40828, 201084, 1044693, 5171998, 24532674, 116470596, 546141979, 2505755010, 11318525016, 50046272884, 219637249269, 944072863998, 4029243437158, 16977344149608, 70370874102975, 289702060529770, 1177283903977008, 4740700176809748
Offset: 0

Views

Author

Andrew Howroyd, Jan 25 2020

Keywords

Comments

The condition that the columns be in decreasing order is equivalent to considering nonequivalent matrices with distinct columns up to permutation of columns.

Examples

			The a(2) = 6 matrices are:
   [1 1]  [1 0]  [1 0]  [2 1]  [2 0]  [1 0]
   [1 0]  [1 1]  [0 1]  [0 1]  [0 2]  [1 2]
   [0 1]  [0 1]  [1 1]

Crossrefs

Column k=2 of A331570.
Cf. A032020, A331646, A331707.

Formula

a(n) = (A331646(n) - A032020(n)) / 2.

A331707 Number of nonnegative integer matrices with 3 distinct columns and any number of distinct nonzero rows with column sums n and columns in decreasing lexicographic order.

Original entry on oeis.org

0, 1, 46, 1900, 73028, 2448599, 75497242, 2339274204, 69674762468, 1979828352817, 54476556180342, 1451352388018928, 37417987990316376, 936855054326483475, 22833066202591181758, 542259452432969505704, 12569324678536063256324, 284784345516356806067001, 6313245421002223574950650
Offset: 0

Views

Author

Andrew Howroyd, Jan 25 2020

Keywords

Comments

The condition that the columns be in decreasing order is equivalent to considering nonequivalent matrices with distinct columns up to permutation of columns.

Examples

			The a(1) = 1 matrix is:
  [1 0 0]
  [0 1 0]
  [0 0 1]

Crossrefs

Column k=3 of A331570.
Cf. A331706.

A331708 Number of nonnegative integer matrices with distinct nonzero rows, total sum n, distinct columns with equals sums and columns in decreasing lexicographic order.

Original entry on oeis.org

1, 2, 4, 10, 6, 100, 14, 832, 1928, 9280, 66, 409928, 134, 3138847, 32173339, 134531629, 618, 9353244335, 1178, 183394485615, 2395983801112, 2311773448717, 4758, 1479147860804022, 311353753955807, 3599356750729620, 613047176698674761, 1842753685676233794, 30462
Offset: 1

Views

Author

Andrew Howroyd, Jan 25 2020

Keywords

Comments

The condition that the columns be in decreasing order is equivalent to considering nonequivalent matrices with distinct columns up to permutation of columns.

Examples

			The a(4) = 10 matrices are:
  [1 0 0 0]  [1 1]  [1 0]  [1 0]
  [0 1 0 0]  [1 0]  [1 1]  [0 1]
  [0 0 1 0]  [0 1]  [0 1]  [1 1]
  [0 0 0 1]
.
  [2 1]  [2 0]  [1 0]  [3]  [1]  [4]
  [0 1]  [0 2]  [1 2]  [1]  [3]

Crossrefs

Cf. A331570.

Formula

a(n) = Sum_{d|n} A331570(n/d, d).
Showing 1-10 of 10 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.