A116539 -id:A116539 - cp's OEIS frontend

A093466 Triangle read by rows: T[n,k] = number of n X n binary matrices with k=0...n^2 ones, distinct up to cyclic shifts of rows and columns; reflection through any vertical or horizontal axis; and reflection through the main diagonal. Also, quasi-n-ominoes on a torus divided into a k X k grid.

1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 4, 5, 5, 4, 2, 1, 1, 1, 1, 5, 10, 33, 53, 101, 122, 153, 122, 101, 53, 33, 10, 5, 1, 1, 1, 1, 5, 19, 88, 309, 975, 2537, 5637, 10510, 16740, 22734, 26500, 26500, 22734, 16740, 10510, 5637, 2537, 975, 309, 88, 19, 5, 1, 1

Offset: 1

Jon Wild, May 21 2004

			[1,1], [1,1,2,1,1], [1,1,2,4,5,5,4,2,1,1] (the last block giving the numbers of 3 X 3 binary matrices with k=0...9 ones, distinct up to the transformations listed above.

Binary matrices with distinct rows and columns, various versions: A059202, A088309, A088310, A088616, A089673, A089674, A093466, A094000, A094223, A116532, A116539, A181230, A259763

A259763 Number of symmetric n X n (0,1)-matrices with pairwise distinct rows and columns.

Original entry on oeis.org

1, 2, 6, 44, 716, 24416, 1680224, 229468288, 61820527104, 32848197477760, 34502874046006912, 71850629135663531776, 297429744309497638961920, 2452504520881914016303901696, 40340635076928240671195746599936, 1324981038432182976845483456362661888, 86953044949519288083916385603832568137728

Offset: 0

Max Alekseyev, Jul 04 2015

nonn

G. C. Greubel, Table of n, a(n) for n = 0..80
MathOverflow, Counting matrices of special types, 2015.

Cf. A088310, A006024

Binary matrices with distinct rows and columns, various versions: A059202, A088309, A088310, A088616, A089673, A089674, A093466, A094000, A094223, A116532, A116539, A181230, A259763

[(&+[StirlingFirst(n,k)*2^Binomial(k+1,2): k in [0..n]]): n in [0..20]]; // G. C. Greubel, Nov 04 2018

Table[Sum[StirlingS1[n,k]*2^Binomial[k+1,2], {k,0,n}], {n,0,20}] (* G. C. Greubel, Nov 04 2018*)

A259763(n) = sum(k=1,n, stirling(n,k,1) * 2^(k*(k+1)/2) );

a(n) = Sum_{k=0..n} Stirling1(n,k) * 2^(k*(k+1)/2).

a(0)=1 prepended by Alois P. Heinz, Jul 12 2015

A319612 Number of regular simple graphs spanning n vertices.

Original entry on oeis.org

1, 0, 1, 1, 7, 13, 171, 931, 45935, 1084413, 155862511, 10382960971, 6939278572095, 2203360500122299, 4186526756621772343, 3747344008241368443819, 35041787059691023579970847, 156277111373303386104606663421, 4142122641757598618318165240180095

Offset: 0

Gus Wiseman, Dec 17 2018

nonn

A graph is regular if all vertices have the same degree. The span of a graph is the union of its edges.

			The a(4) = 7 edge-sets:
  {{1,2},{3,4}}
  {{1,3},{2,4}}
  {{1,4},{2,3}}
  {{1,2},{1,3},{2,4},{3,4}}
  {{1,2},{1,4},{2,3},{3,4}}
  {{1,3},{1,4},{2,3},{2,4}}
  {{1,2},{1,3},{1,4},{2,3},{2,4},{3,4}}

Cf. A002829, A005176, A110100, A116539, A295193, A306017, A319189, A319190.

a(n) = A295193(n) - 1.

a(16)-a(18) from Andrew Howroyd, Sep 02 2019

A382214 Number of normal multisets of size n that can be partitioned into a set of sets.

Original entry on oeis.org

1, 1, 1, 3, 5, 11, 23, 48, 101, 210, 436, 894

Offset: 0

Gus Wiseman, Mar 29 2025

First differs from A382216 at a(9) = 210, A382216(9) = 208.

We call a multiset or multiset partition normal iff it covers an initial interval of positive integers. The size of a multiset is the number of elements, counting multiplicity.

			The normal multiset {1,1,1,1,2,2,3,3,3} has partition {{1},{3},{1,2},{1,3},{1,2,3}}, so is counted under a(9).
The a(1) = 1 through a(5) = 11 multisets:
  {1}  {1,2}  {1,1,2}  {1,1,2,2}  {1,1,1,2,3}
              {1,2,2}  {1,1,2,3}  {1,1,2,2,3}
              {1,2,3}  {1,2,2,3}  {1,1,2,3,3}
                       {1,2,3,3}  {1,1,2,3,4}
                       {1,2,3,4}  {1,2,2,2,3}
                                  {1,2,2,3,3}
                                  {1,2,2,3,4}
                                  {1,2,3,3,3}
                                  {1,2,3,3,4}
                                  {1,2,3,4,4}
                                  {1,2,3,4,5}

Factorizations of this type are counted by A050326, distinct sums A381633.
Normal multiset partitions of this type are counted by A116539, distinct sums A381718.
The complement is counted by A292432.
Twice-partitions of this type are counted by A358914, distinct sums A279785.
The strong version is A381996, complement A292444.
For integer partitions we have A382077, ranks A382200, complement A382078, ranks A293243.
For distinct sums we have A382216, complement A382202.
The case of a unique choice is counted by A382458, distinct sums A382459.
A000670 counts patterns, ranked by A055932 and A333217, necklace A019536.
A001055 count factorizations, strict A045778.
Normal multiset partitions: A034691, A035310, A255906.
Set systems: A050342, A296120, A318361.
Set multipartitions: A089259, A270995, A296119, A318360.
Cf. A000110, A007716, A050320, A116540, A255903, A317532, A326517, A326519, A381990, A381992, A382428, A382460.

allnorm[n_]:=If[n<=0,{{}},Function[s,Array[Count[s,y_/;y<=#]+1&,n]] /@ Subsets[Range[n-1]+1]];
sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]& /@ sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
mps[mset_]:=Union[Sort[Sort/@(#/.x_Integer:>mset[[x]])]& /@ sps[Range[Length[mset]]]];
Table[Length[Select[allnorm[n],Select[mps[#], UnsameQ@@#&&And@@UnsameQ@@@#&]!={}&]],{n,0,5}]

A050345 Number of ways to factor n into distinct factors with one level of parentheses.

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 1, 3, 1, 3, 1, 6, 1, 3, 3, 4, 1, 6, 1, 6, 3, 3, 1, 13, 1, 3, 3, 6, 1, 12, 1, 7, 3, 3, 3, 15, 1, 3, 3, 13, 1, 12, 1, 6, 6, 3, 1, 25, 1, 6, 3, 6, 1, 13, 3, 13, 3, 3, 1, 31, 1, 3, 6, 12, 3, 12, 1, 6, 3, 12, 1, 37, 1, 3, 6, 6, 3, 12, 1, 25, 4, 3, 1, 31, 3, 3, 3, 13, 1, 31, 3, 6, 3, 3

Offset: 1

Christian G. Bower, Oct 15 1999

nonn

First differs from A296120 at a(36) = 15, A296120(36) = 14. - Gus Wiseman, Apr 27 2025
Each "part" in parentheses is distinct from all others at the same level. Thus (3*2)*(2) is allowed but (3)*(2*2) and (3*2*2) are not.
a(n) depends only on prime signature of n (cf. A025487). So a(24) = a(375) since 24 = 2^3*3 and 375 = 3*5^3 both have prime signature (3,1).

			12 = (12) = (6*2) = (6)*(2) = (4*3) = (4)*(3) = (3*2)*(2).
From _Gus Wiseman_, Apr 26 2025: (Start)
This is the number of ways to partition a factorization of n (counted by A001055) into a set of sets. For example, the a(12) = 6 choices are:
  {{2},{2,3}}
  {{2},{6}}
  {{3},{4}}
  {{2,6}}
  {{3,4}}
  {{12}}
(End)

R. J. Mathar, Table of n, a(n) for n = 1..2519

Cf. A050346-A050350. a(A002110)=A000258.
For multisets of multisets we have A050336.
For integer partitions we have a(p^k) = A050342(k), see A001970, A089259, A261049.
For normal multiset partitions see A116539, A292432, A292444, A381996, A382214, A382216.
The case of a unique choice (positions of 1) is A166684.
Twice-partitions of this type are counted by A358914, see A270995, A281113, A294788.
For sets of multisets we have A383310 (distinct products A296118).
For multisets of sets we have we have A383311, see A296119.
A001055 counts factorizations, strict A045778.
A050320 counts factorizations into squarefree numbers, distinct A050326.
A302494 gives MM-numbers of sets of sets.
A382077 counts partitions that can be partitioned into a sets of sets, ranks A382200.
A382078 counts partitions that cannot be partitioned into a sets of sets, ranks A293243.
Cf. A000009, A002865, A005117, A045782, A279785, A293511, A296120, A316439, A381441, A382201.

facs[n_]:=If[n<=1,{{}}, Join@@Table[Map[Prepend[#,d]&, Select[facs[n/d],Min@@#>=d&]],{d, Rest[Divisors[n]]}]];
sps[{}]:={{}};sps[set:{i_,_}] := Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]] /@ Cases[Subsets[set],{i,_}];
mps[set_]:=Union[Sort[Sort /@ (#/.x_Integer:>set[[x]])]& /@ sps[Range[Length[set]]]];
Table[Sum[Length[Select[mps[y], UnsameQ@@#&&And@@UnsameQ@@@#&]], {y,facs[n]}],{n,30}] (* Gus Wiseman, Apr 26 2025 *)

Dirichlet g.f.: Product_{n>=2}(1+1/n^s)^A045778(n).
a(n) = A050346(A025487^(-1)(A046523(n))), where A025487^(-1) is the inverse with A025487^(-1)(A025487(n))=n. - R. J. Mathar, May 25 2017
a(n) = A050346(A101296(n)). - Antti Karttunen, May 25 2017

A088616 a(n) = number of n X n (0,1) matrices A such that the 2n vectors consisting of the rows and the columns of the matrix A are all distinct.

Original entry on oeis.org

0, 0, 24, 6840, 6568800, 22080988800, 262378244741760

Offset: 1

Yuval Dekel and Vladeta Jovovic, Nov 17 2003

What if you also ask that the two main diagonals are also distinct? - N. J. A. Sloane, Jan 03 2004

Cf. A088310.

Binary matrices with distinct rows and columns, various versions: A059202, A088309, A088310, A088616, A089673, A089674, A093466, A094000, A094223, A116532, A116539, A181230, A259763

a(6)-a(7) from Bert Dobbelaere, May 05 2025

A089673 a(n) = number of n X n (0,1) matrices A such that the 2n+2 vectors consisting of the rows and the columns of the matrix A, as well as the main diagonal and the main antidiagonal, are all distinct.

Original entry on oeis.org

0, 0, 0, 652, 1658784, 10726929248, 172790068546048

Offset: 1

Vladeta Jovovic, Jan 04 2004

Cf. A088310, A088616, A089674.

Binary matrices with distinct rows and columns, various versions: A059202, A088309, A088310, A088616, A089673, A089674, A093466, A094000, A094223, A116532, A116539, A181230, A259763

a(6)-a(7) from Bert Dobbelaere, May 05 2025

A089674 a(n) = number of n X n (0,1) matrices A such that the 2n+2 vectors consisting of the rows and the columns of the matrix A, as well as the main diagonal read in the upward direction and the main antidiagonal, are all distinct.

Original entry on oeis.org

0, 0, 0, 1692, 2329280, 13441654352, 190945826194432

Offset: 1

Vladeta Jovovic, Jan 04 2004

Cf. A088310, A088616, A089673.

Binary matrices with distinct rows and columns, various versions: A059202, A088309, A088310, A088616, A089673, A089674, A093466, A094000, A094223, A116532, A116539, A181230, A259763

a(6)-a(7) from Bert Dobbelaere, May 05 2025

A094223 Number of binary n X n matrices with all rows (columns) distinct, up to permutation of columns (rows).

Original entry on oeis.org

1, 2, 7, 68, 2251, 247016, 89254228, 108168781424, 451141297789858, 6625037125817801312, 348562672319990399962384, 66545827618461283102105245248, 46543235997095840080425299916917968, 120155975713532210671953821005746669185792, 1152009540439950050422144845158703009569109376384

Offset: 0

Goran Kilibarda and Vladeta Jovovic, May 28 2004

Andrew Howroyd, Table of n, a(n) for n = 0..50
Goran Kilibarda and Vladeta Jovovic, Enumeration of some classes of T_0-hypergraphs, arXiv:1411.4187 [math.CO], 2014.

Main diagonal of A059584 and A059587, A060690, A088309.

Binary matrices with distinct rows and columns, various versions: A059202, A088309, A088310, A088616, A089673, A089674, A093466, A094000, A094223, A116532, A116539, A181230, A259763

a[n_] := Sum[(-1)^(n - k)*StirlingS1[n, k]*Binomial[2^k, n], {k, 0, n}]; (* or *) a[n_] := Sum[ StirlingS1[n, k]*Binomial[2^k + n - 1, n], {k, 0, n}]; Table[ a[n], {n, 0, 12}] (* Robert G. Wilson v, May 29 2004 *)

a(n) = sum(k=0, n, stirling(n, k, 1)*binomial(2^k+n-1, n)); \\ Michel Marcus, Dec 17 2022

a(n) = Sum_{k=0..n} (-1)^(n-k)*Stirling1(n, k)*binomial(2^k, n).

a(n) = Sum_{k=0..n} Stirling1(n, k)*binomial(2^k+n-1, n).

More terms from Robert G. Wilson v, May 29 2004

a(13) onwards from Andrew Howroyd, Jan 20 2024

A382079 Number of integer partitions of n that can be partitioned into a set of sets in exactly one way.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 3, 4, 6, 5, 10, 9, 13, 14, 21, 20, 32, 31, 42, 47, 63, 62, 90, 94, 117, 138, 170, 186, 235, 260, 315, 363, 429, 493, 588, 674, 795, 901, 1060, 1209, 1431, 1608, 1896, 2152, 2515, 2854, 3310, 3734, 4368, 4905, 5686

Offset: 0

Gus Wiseman, Mar 20 2025

			The unique multiset partition for (3222111) is {{1},{2},{1,2},{1,2,3}}.
The a(1) = 1 through a(12) = 13 partitions:
  1  2  3  4    5    6     7    8      9      A      B      C
           211  221  411   322  332    441    433    443    552
                311  2211  331  422    522    442    533    633
                           511  611    711    622    551    822
                                3311   42111  811    722    A11
                                32111         3322   911    4422
                                              4411   42221  5511
                                              32221  53111  33321
                                              43111  62111  52221
                                              52111         54111
                                                            63111
                                                            72111
                                                            3222111

Normal multiset partitions of this type are counted by A116539, see A381718.
These partitions are ranked by A293511.
MM-numbers of these multiset partitions (sets of sets) are A302494, see A302478, A382201.
Twice-partitions of this type (sets of sets) are counted by A358914, see A279785.
For at least one choice we have A382077 (ranks A382200), see A381992 (ranks A382075).
For no choices we have A382078 (ranks A293243), see A381990 (ranks A381806).
For distinct block-sums instead of blocks we have A382460, ranked by A381870.
Set multipartitions: A089259, A116540, A270995, A296119, A318360.
A000041 counts integer partitions, strict A000009.
A050320 counts multiset partitions of prime indices into sets.
A050326 counts multiset partitions of prime indices into distinct sets, see A381633.
A265947 counts refinement-ordered pairs of integer partitions.
Cf. A002846, A213427, A299202, A317142, A381078, A381441, A381454, A381636.

ssfacs[n_]:=If[n<=1,{{}},Join@@Table[(Prepend[#,d]&)/@Select[ssfacs[n/d],Min@@#>d&],{d,Select[Rest[Divisors[n]],SquareFreeQ]}]];
Table[Length[Select[IntegerPartitions[n],Length[ssfacs[Times@@Prime/@#]]==1&]],{n,0,15}]

a(21)-a(50) from Bert Dobbelaere, Mar 29 2025

cp's OEIS Frontend

A093466 Triangle read by rows: T[n,k] = number of n X n binary matrices with k=0...n^2 ones, distinct up to cyclic shifts of rows and columns; reflection through any vertical or horizontal axis; and reflection through the main diagonal. Also, quasi-n-ominoes on a torus divided into a k X k grid.

Views

Author

Keywords

Examples

Crossrefs

A259763 Number of symmetric n X n (0,1)-matrices with pairwise distinct rows and columns.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A319612 Number of regular simple graphs spanning n vertices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

Extensions

A382214 Number of normal multisets of size n that can be partitioned into a set of sets.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A050345 Number of ways to factor n into distinct factors with one level of parentheses.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A088616 a(n) = number of n X n (0,1) matrices A such that the 2n vectors consisting of the rows and the columns of the matrix A are all distinct.

Views

Author

Keywords

Comments

Crossrefs

Extensions

A089673 a(n) = number of n X n (0,1) matrices A such that the 2n+2 vectors consisting of the rows and the columns of the matrix A, as well as the main diagonal and the main antidiagonal, are all distinct.

Views

Author

Keywords

Crossrefs

Extensions

A089674 a(n) = number of n X n (0,1) matrices A such that the 2n+2 vectors consisting of the rows and the columns of the matrix A, as well as the main diagonal read in the upward direction and the main antidiagonal, are all distinct.

Views

Author

Keywords

Crossrefs

Extensions

A094223 Number of binary n X n matrices with all rows (columns) distinct, up to permutation of columns (rows).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A382079 Number of integer partitions of n that can be partitioned into a set of sets in exactly one way.

Views