A049311 -id:A049311 - cp's OEIS frontend

A323791 Number of non-isomorphic weight-n sets of multisets of sets.

1, 1, 4, 13, 52, 196, 877, 3917

Offset: 0

Gus Wiseman, Jan 27 2019

All sets and multisets must be finite, and only the outermost may be empty.

The weight of an atom is 1, and the weight of a multiset is the sum of weights of its elements, counting multiplicity.

			Non-isomorphic representatives of the a(1) = 1 through a(3) = 13 sets of multisets of sets:
  {{1}}  {{12}}      {{123}}
         {{1}{1}}    {{1}{12}}
         {{1}{2}}    {{1}{23}}
         {{1}}{{2}}  {{1}{1}{1}}
                     {{1}}{{12}}
                     {{1}{1}{2}}
                     {{1}}{{23}}
                     {{1}{2}{3}}
                     {{1}}{{1}{1}}
                     {{1}}{{1}{2}}
                     {{1}}{{2}{3}}
                     {{2}}{{1}{1}}
                     {{1}}{{2}}{{3}}

Cf. A007716, A049311, A050326, A050343, A283877, A306186, A316980, A318564, A318565, A318566, A318812.

Cf. A323787, A323788, A323789, A323790, A323792, A323793, A323794, A323795.

A323792 Number of non-isomorphic weight-n multisets of sets of sets.

Original entry on oeis.org

1, 1, 4, 11, 43, 145, 614, 2549

Offset: 0

Gus Wiseman, Jan 27 2019

All sets and multisets must be finite, and only the outermost may be empty.

The weight of an atom is 1, and the weight of a multiset is the sum of weights of its elements, counting multiplicity.

			Non-isomorphic representatives of the a(1) = 1 through a(3) = 11 multiset partitions:
  {{1}}  {{12}}      {{123}}
         {{1}{2}}    {{1}{12}}
         {{1}}{{1}}  {{1}{23}}
         {{1}}{{2}}  {{1}}{{12}}
                     {{1}}{{23}}
                     {{1}{2}{3}}
                     {{1}}{{1}{2}}
                     {{1}}{{2}{3}}
                     {{1}}{{1}}{{1}}
                     {{1}}{{1}}{{2}}
                     {{1}}{{2}}{{3}}

Cf. A007716, A049311, A050326, A050343, A255906, A283877, A306186, A316980, A318564, A318565, A318566.

Cf. A323787, A323788, A323789, A323790, A323791, A323793, A323794, A323795.

A323793 Number of non-isomorphic weight-n multisets of multisets of sets.

Original entry on oeis.org

1, 1, 5, 15, 65, 240, 1090, 4845

Offset: 0

Gus Wiseman, Jan 27 2019

Also the number of non-isomorphic multiset partitions of set multipartitions of weight n.
All sets and multisets must be finite, and only the outermost may be empty.
The weight of an atom is 1, and the weight of a multiset is the sum of weights of its elements, counting multiplicity.

			Non-isomorphic representatives of the a(1) = 1 through a(3) = 15 multiset partitions:
  {{1}}  {{12}}      {{123}}
         {{1}{1}}    {{1}{12}}
         {{1}{2}}    {{1}{23}}
         {{1}}{{1}}  {{1}{1}{1}}
         {{1}}{{2}}  {{1}}{{12}}
                     {{1}{1}{2}}
                     {{1}}{{23}}
                     {{1}{2}{3}}
                     {{1}}{{1}{1}}
                     {{1}}{{1}{2}}
                     {{1}}{{2}{3}}
                     {{2}}{{1}{1}}
                     {{1}}{{1}}{{1}}
                     {{1}}{{1}}{{2}}
                     {{1}}{{2}}{{3}}

Cf. A007716, A049311, A283877, A306186, A316980, A318565, A318566.

Cf. A323787, A323788, A323789, A323790, A323791, A323792, A323794, A323795.

A323794 Number of non-isomorphic weight-n multisets of sets of multisets.

Original entry on oeis.org

1, 1, 5, 17, 77, 318, 1561, 7667

Offset: 0

Gus Wiseman, Jan 28 2019

Also the number of non-isomorphic set multipartitions of multiset partitions of weight n.
All sets and multisets must be finite, and only the outermost may be empty.
The weight of an atom is 1, and the weight of a multiset is the sum of weights of its elements, counting multiplicity.

			Non-isomorphic representatives of the a(1) = 1 through a(3) = 17 multiset partitions:
  {{1}}  {{11}}      {{111}}
         {{12}}      {{112}}
         {{1}{2}}    {{123}}
         {{1}}{{1}}  {{1}{11}}
         {{1}}{{2}}  {{1}{12}}
                     {{1}{23}}
                     {{2}{11}}
                     {{1}}{{11}}
                     {{1}}{{12}}
                     {{1}}{{23}}
                     {{1}{2}{3}}
                     {{2}}{{11}}
                     {{1}}{{1}{2}}
                     {{1}}{{2}{3}}
                     {{1}}{{1}}{{1}}
                     {{1}}{{1}}{{2}}
                     {{1}}{{2}}{{3}}

Cf. A007716, A049311, A283877, A306186, A316980, A317791, A318565, A318566.

Cf. A323787, A323788, A323789, A323790, A323791, A323792, A323793, A323795.

A368533 Numbers whose binary indices are all squarefree.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 16, 17, 18, 19, 20, 21, 22, 23, 32, 33, 34, 35, 36, 37, 38, 39, 48, 49, 50, 51, 52, 53, 54, 55, 64, 65, 66, 67, 68, 69, 70, 71, 80, 81, 82, 83, 84, 85, 86, 87, 96, 97, 98, 99, 100, 101, 102, 103, 112, 113, 114, 115, 116, 117, 118, 119, 512

Offset: 1

Gus Wiseman, Mar 23 2024

The complement first differs from A115419 in having 128.

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.

			The terms together with their binary expansions and binary indices begin:
    0:       0 ~ {}
    1:       1 ~ {1}
    2:      10 ~ {2}
    3:      11 ~ {1,2}
    4:     100 ~ {3}
    5:     101 ~ {1,3}
    6:     110 ~ {2,3}
    7:     111 ~ {1,2,3}
   16:   10000 ~ {5}
   17:   10001 ~ {1,5}
   18:   10010 ~ {2,5}
   19:   10011 ~ {1,2,5}
   20:   10100 ~ {3,5}
   21:   10101 ~ {1,3,5}
   22:   10110 ~ {2,3,5}
   23:   10111 ~ {1,2,3,5}
   32:  100000 ~ {6}
   33:  100001 ~ {1,6}
   34:  100010 ~ {2,6}
   35:  100011 ~ {1,2,6}
   36:  100100 ~ {3,6}
   37:  100101 ~ {1,3,6}
   38:  100110 ~ {2,3,6}

Set multipartitions: A049311, A050320, A089259, A116540.
For prime indices instead of binary indices we have A302478.
The case of prime binary indices is A326782.
The case of squarefree product is A371289.
For prime-power product we have A371290.
For nonprime binary indices we have A371443, composite A371444.
The semiprime case is A371453, squarefree case of A371454.
A005117 lists squarefree numbers.
A048793 lists binary indices, A000120 length, A272020 reverse, A029931 sum.
A070939 gives length of binary expansion.
A096111 gives product of binary indices.
Cf. A000040, A001222, A087086, A296119, A326031, A367905, A368109, A371450.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[0,100],And@@SquareFreeQ/@bpe[#]&]

from math import isqrt
from sympy import mobius
def A368533(n):
    def f(x,n): return int(n+x-sum(mobius(k)*(x//k**2) for k in range(1, isqrt(x)+1)))
    def A005117(n):
        m, k = n, f(n,n)
        while m != k: m, k = k, f(k,n)
        return m
    return sum(1<<A005117(i)-1 for i, j in enumerate(bin(n-1)[:1:-1],1) if j=='1') # Chai Wah Wu, Oct 24 2024

A053304 Number of 7 X 7 binary matrices with n=0..49 ones up to row and column permutations.

Original entry on oeis.org

1, 1, 3, 6, 16, 34, 90, 211, 515, 1229, 2960, 6893, 15753, 34450, 72235, 143477, 269186, 473945, 781713, 1203617, 1728192, 2310376, 2874232, 3325215, 3576980, 3576980, 3325215, 2874232, 2310376, 1728192, 1203617, 781713, 473945, 269186

Offset: 0

Vladeta Jovovic, Mar 05 2000

Andrew Howroyd, Table of n, a(n) for n = 0..49

Row 7 of A052371 and A321609.

Cf. A002724, A049311.

\\ See A321609 for M.
vector(50, n, M(7,7,n-1))

a(n) = A049311(n) for n <= 7.

Sum_{n=0..49} a(n) = 33642660 = A002724(7).

A057149 Triangle T(n,k) of n X n binary matrices with k ones, with no zero rows or columns, up to row and column permutation.

Original entry on oeis.org

0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 2, 5, 4, 3, 1, 1, 0, 0, 0, 0, 1, 2, 11, 21, 34, 33, 33, 19, 14, 6, 3, 1, 1, 0, 0, 0, 0, 0, 1, 2, 14, 49, 131, 248, 410, 531, 601, 566, 474, 336, 222, 124, 67, 32, 16, 6, 3, 1, 1, 0, 0, 0, 0, 0, 0, 1, 2, 15, 69, 288, 840, 2144, 4488, 8317, 13160

Offset: 1

Vladeta Jovovic, Aug 14 2000

Row sums give A054976.

			[0,1], [0,0,1,1,1], [0,0,0,1,2,5,4,3,1,1],...;
T(4,6)=11, i.e. there are 11 4 X 4 binary matrices with 6 ones, with no zero rows or columns, up to row and column permutation:
[0 0 0 1] [0 0 0 1] [0 0 0 1] [0 0 0 1] [0 0 0 1] [0 0 0 1]
[0 0 0 1] [0 0 0 1] [0 0 0 1] [0 0 0 1] [0 0 0 1] [0 0 1 0]
[0 0 0 1] [0 0 1 0] [0 0 1 0] [0 0 1 1] [0 1 1 0] [0 0 1 1]
[1 1 1 0] [1 1 0 1] [1 1 1 0] [1 1 0 0] [1 0 1 0] [1 1 0 0]
and
[0 0 0 1] [0 0 0 1] [0 0 0 1] [0 0 0 1] [0 0 0 1]
[0 0 1 0] [0 0 1 0] [0 0 1 0] [0 0 1 0] [0 0 1 0]
[0 1 0 0] [0 1 0 1] [0 1 0 1] [0 1 0 1] [1 1 0 0]
[1 0 1 1] [1 0 0 1] [1 0 1 0] [1 1 0 0] [1 1 0 0].

Sean A. Irvine, Table of n, a(n) for n = 1..1029
Sean A. Irvine, Java program (github)

Cf. A056080, A056037, A056079, A057150-A057152, A049311.

A306007 Number of non-isomorphic intersecting antichains of weight n.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 6, 6, 14, 22

Offset: 0

Gus Wiseman, Jun 16 2018

An intersecting antichain S is a finite set of finite nonempty sets (edges), any two of which have a nonempty intersection, and none of which is a subset of any other. The weight of S is the sum of cardinalities of its elements. Weight is generally not the same as number of vertices.

			Non-isomorphic representatives of the a(8) = 14 set-systems:
{{1,2,3,4,5,6,7,8}}
{{1,7},{2,3,4,5,6,7}}
{{1,2,7},{3,4,5,6,7}}
{{1,5,6},{2,3,4,5,6}}
{{1,2,3,7},{4,5,6,7}}
{{1,2,5,6},{3,4,5,6}}
{{1,3,4,5},{2,3,4,5}}
{{1,2},{1,3,4},{2,3,4}}
{{1,4},{1,5},{2,3,4,5}}
{{1,5},{2,4,5},{3,4,5}}
{{1,6},{2,6},{3,4,5,6}}
{{1,6},{2,3,6},{4,5,6}}
{{2,4},{1,2,5},{3,4,5}}
{{1,5},{2,5},{3,5},{4,5}}

Cf. A007411, A007716, A034691, A048143, A049311, A116540, A283877, A293606, A293607, A304867, A305999, A305854-A305857, A306005-A306008.

A319566 Number of non-isomorphic connected T_0 set systems of weight n.

Original entry on oeis.org

1, 1, 0, 1, 2, 3, 8, 17, 41, 103, 276

Offset: 0

Gus Wiseman, Sep 23 2018

In a set system, two vertices are equivalent if in every block the presence of the first is equivalent to the presence of the second. The T_0 condition means that there are no equivalent vertices.

The weight of a set system is the sum of sizes of its parts. Weight is generally not the same as number of vertices.

			Non-isomorphic representatives of the a(1) = 1 through a(6) = 8 set systems:
1:        {{1}}
3:     {{2},{1,2}}
4:    {{1,3},{2,3}}
     {{1},{2},{1,2}}
5:  {{2},{3},{1,2,3}}
    {{2},{1,3},{2,3}}
    {{3},{1,3},{2,3}}
6: {{3},{1,4},{2,3,4}}
   {{3},{2,3},{1,2,3}}
   {{1,2},{1,3},{2,3}}
   {{1,3},{2,4},{3,4}}
   {{1,4},{2,4},{3,4}}
  {{1},{2},{3},{1,2,3}}
  {{1},{2},{1,3},{2,3}}
  {{2},{3},{1,3},{2,3}}

Cf. A007716, A007718, A049311, A056156, A059201, A283877, A316980.

Cf. A319557, A319558, A319559, A319560, A319564, A319565, A319567.

A056152 Triangular array giving number of bipartite graphs with n vertices, no isolated vertices and a distinguished bipartite block with k=1..n-1 vertices, up to isomorphism.

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 1, 5, 5, 1, 1, 8, 17, 8, 1, 1, 11, 42, 42, 11, 1, 1, 15, 91, 179, 91, 15, 1, 1, 19, 180, 633, 633, 180, 19, 1, 1, 24, 328, 2001, 3835, 2001, 328, 24, 1, 1, 29, 565, 5745, 20755, 20755, 5745, 565, 29, 1, 1, 35, 930, 15274, 102089, 200082, 102089

Offset: 2

Vladeta Jovovic, Jul 29 2000

Also table read by rows: for 0 < k < n, a(n, k) = number of bipartite graphs with n vertices, no isolated vertices and a distinguished bipartite block with k vertices, up to isomorphism.
a(n, k) is the number of isomorphism classes of finite subdirectly irreducible almost distributive lattices in which the N-quotient has k upper covers and (n - k) lower covers. - David Wasserman, Feb 11 2002
Also, row n gives the number of unlabeled bicolored graphs having k nodes of one color and n-k nodes of the other color, with no isolated nodes; the color classes are not interchangeable.

			Triangle begins:
  1;
  1,  1;
  1,  3,   1;
  1,  5,   5,   1;
  1,  8,  17,   8,  1;
  1, 11,  42,  42,  11,  1;
  1, 15,  91, 179,  91,  15,  1;
  1, 19, 180, 633, 633, 180, 19, 1;
  ...
There are 17 bipartite graphs with 6 vertices, no isolated vertices and a distinguished bipartite block with 3 vertices, or equivalently, there are 17 3 X 3 binary matrices with no zero rows or columns, up to row and column permutation:
[0 0 1] [0 0 1] [0 0 1] [0 0 1] [0 0 1] [0 0 1] [0 0 1] [0 0 1] [0 0 1]
[0 0 1] [0 0 1] [0 1 0] [0 1 0] [0 1 0] [0 1 1] [0 1 1] [0 1 1] [1 1 0]
[1 1 0] [1 1 1] [1 0 0] [1 0 1] [1 1 1] [1 0 1] [1 1 0] [1 1 1] [1 1 0]
and
[0 0 1] [0 0 1] [0 1 1] [0 1 1] [0 1 1] [0 1 1] [0 1 1] [1 1 1]
[1 1 0] [1 1 1] [0 1 1] [0 1 1] [1 0 1] [1 0 1] [1 1 1] [1 1 1]
[1 1 1] [1 1 1] [1 0 1] [1 1 1] [1 1 0] [1 1 1] [1 1 1] [1 1 1].

J. G. Lee, Almost Distributive Lattice Varieties, Algebra Universalis, 21 (1985), 280-304.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.

F. Harary, L. March and R. W. Robinson, On enumerating certain design problems in terms of bicolored graphs with no isolates, Environment and Planning, B 5 (1978), 31-43. See Table 2.
F. Harary, L. March and R. W. Robinson, On enumerating certain design problems in terms of bicolored graphs with no isolates, Environment and Planning B: Urban Analytics and City Science, 5 (1978), 31-43. [Annotated scanned copy] See Table 2.

Columns k=1..6 are A000012, A024206, A055609, A055082, A055083, A055084.
Row sums give A055192.
See A122083 for another version of this triangle.
Cf. A049312, A048194, A028657, A049311.

cp's OEIS Frontend

A323791 Number of non-isomorphic weight-n sets of multisets of sets.

Views

Author

Keywords

Comments

Examples

Crossrefs

A323792 Number of non-isomorphic weight-n multisets of sets of sets.

Views

Author

Keywords

Comments

Examples

Crossrefs

A323793 Number of non-isomorphic weight-n multisets of multisets of sets.

Views

Author

Keywords

Comments

Examples

Crossrefs

A323794 Number of non-isomorphic weight-n multisets of sets of multisets.

Views

Author

Keywords

Comments

Examples

Crossrefs

A368533 Numbers whose binary indices are all squarefree.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

A053304 Number of 7 X 7 binary matrices with n=0..49 ones up to row and column permutations.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A057149 Triangle T(n,k) of n X n binary matrices with k ones, with no zero rows or columns, up to row and column permutation.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A306007 Number of non-isomorphic intersecting antichains of weight n.

Views

Author

Keywords

Comments

Examples

Crossrefs

A319566 Number of non-isomorphic connected T_0 set systems of weight n.

Views

Author

Keywords

Comments

Examples

Crossrefs

A056152 Triangular array giving number of bipartite graphs with n vertices, no isolated vertices and a distinguished bipartite block with k=1..n-1 vertices, up to isomorphism.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs