A319269 -id:A319269 - cp's OEIS frontend

A259936 Number of ways to express the integer n as a product of its unitary divisors (A034444).

1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 5, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 5, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 5, 1, 2, 2, 1, 2, 5, 1, 2, 2, 5, 1, 2, 1, 2, 2, 2, 2, 5, 1, 2, 1, 2, 1, 5, 2, 2, 2, 2, 1, 5, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 5, 1, 2, 5

Offset: 1

Geoffrey Critzer, Jul 09 2015

nonn

Equivalently, a(n) is the number of ways to express the cyclic group Z_n as a direct sum of its Hall subgroups.  A Hall subgroup of a finite group G is a subgroup whose order is coprime to its index.
a(n) is the number of ways to partition the set of distinct prime factors of n.
Also the number of singleton or pairwise coprime factorizations of n. - Gus Wiseman, Sep 24 2019

			a(60) = 5 because we have: 60 = 4*3*5 = 4*15 = 3*20 = 5*12.
For n = 36, its unitary divisors are 1, 4, 9, 36. From these we obtain 36 either as 1*36 or 4*9, thus a(36) = 2. - _Antti Karttunen_, Oct 21 2017

Alois P. Heinz, Table of n, a(n) for n = 1..20000
Wikipedia, Hall subgroup
Index entries for sequences computed from exponents in factorization of n

Cf. A000110, A001055, A001221, A034444, A089233, A258466, A281116, A285572.
Differs from A050320 for the first time at n=36.
Differs from A354870 for the first time at n=210, where a(210) = 15, while A354870(210) = 12.
Cf. A304716, A302569, A304711, A305079.
Related classes of factorizations:
- No conditions: A001055
- Strict: A045778
- Constant: A089723
- Distinct multiplicities: A255231
- Singleton or coprime: A259936
- Relatively prime: A281116
- Aperiodic: A303386
- Stable (indivisible): A305149
- Connected: A305193
- Strict relatively prime: A318721
- Uniform: A319269
- Intersecting: A319786
- Constant or distinct factors coprime: A327399
- Constant or relatively prime: A327400
- Coprime: A327517
- Not relatively prime: A327658
- Distinct factors coprime: A327695

map(combinat:-bell @ nops @ numtheory:-factorset, [$1..100]); # Robert Israel, Jul 09 2015

Table[BellB[PrimeNu[n]], {n, 1, 75}]
(* second program *)
facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[Select[facs[n],Length[#]==1||CoprimeQ@@#&]],{n,100}] (* Gus Wiseman, Sep 24 2019 *)

a(n) = my(t=omega(n), x='x, m=contfracpnqn(matrix(2, t\2, y, z, if( y==1, -z*x^2, 1 - (z+1)*x)))); polcoeff(1/(1 - x + m[2, 1]/m[1, 1]) + O(x^(t+1)), t) \\ Charles R Greathouse IV, Jun 30 2017

a(n) = A000110(A001221(n)).

a(n > 1) = A327517(n) + 1. - Gus Wiseman, Sep 24 2019

Incorrect comment removed by Antti Karttunen, Jun 11 2022

A326783 BII-numbers of uniform set-systems.

Original entry on oeis.org

0, 1, 2, 3, 4, 8, 9, 10, 11, 16, 20, 32, 36, 48, 52, 64, 128, 129, 130, 131, 136, 137, 138, 139, 256, 260, 272, 276, 288, 292, 304, 308, 512, 516, 528, 532, 544, 548, 560, 564, 768, 772, 784, 788, 800, 804, 816, 820, 1024, 1088, 2048, 2052, 2064, 2068, 2080

Offset: 1

Gus Wiseman, Jul 25 2019

nonn

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. We define the set-system with BII-number n to be obtained by taking the binary indices of each binary index of n. A set-system is uniform if all edges have the same size.

Alternatively, these are numbers whose binary indices all have the same binary weight, where the binary weight of a nonnegative integer is the numbers of 1's in its binary digits.

			The sequence of all uniform set-systems together with their BII-numbers begins:
    0: {}
    1: {{1}}
    2: {{2}}
    3: {{1},{2}}
    4: {{1,2}}
    8: {{3}}
    9: {{1},{3}}
   10: {{2},{3}}
   11: {{1},{2},{3}}
   16: {{1,3}}
   20: {{1,2},{1,3}}
   32: {{2,3}}
   36: {{1,2},{2,3}}
   48: {{1,3},{2,3}}
   52: {{1,2},{1,3},{2,3}}
   64: {{1,2,3}}
  128: {{4}}
  129: {{1},{4}}
  130: {{2},{4}}
  131: {{1},{2},{4}}

Cf. A000120, A029931, A048793, A070939, A047966, A306017, A306021, A319269, A320324, A326031, A326784 (regular), A326785 (uniform regular), A326788.

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

A336618 Maximum divisor of n! with equal prime multiplicities.

Original entry on oeis.org

1, 1, 2, 6, 8, 30, 36, 210, 210, 1296, 1296, 2310, 7776, 30030, 44100, 46656, 46656, 510510, 1679616, 9699690, 9699690, 10077696, 10077696, 223092870, 223092870, 729000000, 901800900, 13060694016, 13060694016, 13060694016, 78364164096, 200560490130

Offset: 0

Gus Wiseman, Jul 30 2020

nonn

A number has equal prime multiplicities iff it is a power of a squarefree number. We call such numbers uniform, so a(n) is the maximum uniform divisor of n!.

			The sequence of terms together with their prime signatures begins:
       1: ()
       1: ()
       2: (1)
       6: (1,1)
       8: (3)
      30: (1,1,1)
      36: (2,2)
     210: (1,1,1,1)
     210: (1,1,1,1)
    1296: (4,4)
    1296: (4,4)
    2310: (1,1,1,1,1)
    7776: (5,5)
   30030: (1,1,1,1,1,1)
   44100: (2,2,2,2)

Amiram Eldar, Table of n, a(n) for n = 0..1000
Gus Wiseman, Sequences counting and encoding certain classes of multisets.

A327526 is the non-factorial generalization, with quotient A327528.
A336415 counts these divisors.
A336616 is the version for distinct prime multiplicities.
A336619 is the quotient n!/a(n).
A047966 counts uniform partitions.
A071625 counts distinct prime multiplicities.
A072774 lists uniform numbers.
A130091 lists numbers with distinct prime multiplicities.
A181796 counts divisors with distinct prime multiplicities.
A319269 counts uniform factorizations.
A327524 counts factorizations of uniform numbers into uniform numbers.
A327527 counts uniform divisors.
Cf. A000005, A001222, A001597, A007916, A098859, A124010, A182853, A327498.
Factorial numbers: A000142, A007489, A022559, A027423, A048656, A071626, A108731, A325272, A325273, A325617, A336414, A336416.

Table[Max@@Select[Divisors[n!],SameQ@@Last/@FactorInteger[#]&],{n,0,15}]

a(n) = A327526(n!).

A336619 a(n) = n!/d where d is the maximum divisor of n! with equal prime exponents.

Original entry on oeis.org

1, 1, 1, 1, 3, 4, 20, 24, 192, 280, 2800, 17280, 61600, 207360, 1976832, 28028000, 448448000, 696729600, 3811808000, 12541132800, 250822656000, 5069704640000, 111533502080000, 115880067072000, 2781121609728000, 21277380032004096, 447206762741760000

Offset: 0

Gus Wiseman, Jul 30 2020

nonn

A number has equal prime exponents iff it is a power of a squarefree number. We call such numbers uniform, so a(n) is n! divided by the maximum uniform divisor of n!.

After the first three terms, is this sequence strictly increasing?

			The sequence of terms together with their prime signatures begins:
           1: ()
           1: ()
           1: ()
           1: ()
           3: (1)
           4: (2)
          20: (2,1)
          24: (3,1)
         192: (6,1)
         280: (3,1,1)
        2800: (4,2,1)
       17280: (7,3,1)
       61600: (5,2,1,1)
      207360: (9,4,1)
     1976832: (9,3,1,1)
    28028000: (5,3,2,1,1)
   448448000: (9,3,2,1,1)
   696729600: (14,5,2,1)
  3811808000: (8,3,2,1,1,1)

Amiram Eldar, Table of n, a(n) for n = 0..500
Gus Wiseman, Sequences counting and encoding certain classes of multisets.

A327528 is the non-factorial generalization, with quotient A327526.
A336415 counts these divisors.
A336617 is the version for distinct prime exponents.
A336618 is the quotient n!/a(n).
A047966 counts uniform partitions.
A071625 counts distinct prime exponents.
A072774 gives Heinz numbers of uniform partitions, with nonprime terms A182853.
A130091 lists numbers with distinct prime exponents.
A181796 counts divisors with distinct prime exponents.
A319269 counts uniform factorizations.
A327524 counts factorizations of uniform numbers into uniform numbers.
A327527 counts uniform divisors.
Cf. A000005, A001222, A001597, A007916, A098859, A118914, A124010, A327498, A327499, A336616.
Factorial numbers: A000142, A007489, A022559, A027423, A048656, A071626, A108731, A325272, A325273, A325617, A336414, A336416.

Table[n!/Max@@Select[Divisors[n!],SameQ@@Last/@FactorInteger[#]&],{n,0,15}]

a(n) = n!/A336618(n) = n!/A327526(n!).

A320888 Number of set multipartitions (multisets of sets) of factorizations of n into factors > 1 such that all the parts have the same product.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 2, 2, 4, 1, 3, 1, 3, 2, 2, 1, 5, 2, 2, 3, 3, 1, 5, 1, 4, 2, 2, 2, 8, 1, 2, 2, 5, 1, 5, 1, 3, 3, 2, 1, 7, 2, 3, 2, 3, 1, 5, 2, 5, 2, 2, 1, 9, 1, 2, 3, 9, 2, 5, 1, 3, 2, 5, 1, 9, 1, 2, 3, 3, 2, 5, 1, 7, 4, 2, 1, 9, 2, 2, 2

Offset: 1

Gus Wiseman, Oct 23 2018

nonn

			The a(144) = 20 set multipartitions:
  (2*3*4*6)    (2*8*9)     (2*72)     (144)
  (2*6)*(2*6)  (3*6*8)     (3*48)
  (2*6)*(3*4)  (2*3*24)    (4*36)
  (3*4)*(3*4)  (2*4*18)    (6*24)
               (2*6*12)    (8*18)
               (3*4*12)    (9*16)
               (12)*(2*6)  (12)*(12)
               (12)*(3*4)

Cf. A001055, A001970, A045778, A050336, A052409, A089259, A294786, A296132, A319269, A320886, A320887, A320889.

strfacs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[strfacs[n/d],Min@@#>d&]],{d,Rest[Divisors[n]]}]];
Table[With[{g=GCD@@FactorInteger[n][[All,2]]},Sum[Binomial[Length[strfacs[n^(1/d)]]+d-1,d],{d,Divisors[g]}]],{n,100}]

a(n) = Sum_{d|A052409(n)} binomial(A045778(n^(1/d)) + d - 1, d).

A327400 Number of factorizations of n that are constant or whose factors are relatively prime.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 1, 4, 2, 2, 2, 3, 1, 5, 1, 2, 2, 2, 2, 7, 1, 2, 2, 4, 1, 5, 1, 3, 3, 2, 1, 6, 2, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 9, 1, 2, 3, 4, 2, 5, 1, 3, 2, 5, 1, 10, 1, 2, 3, 3, 2, 5, 1, 6, 3, 2, 1, 9, 2, 2, 2

Offset: 1

Gus Wiseman, Sep 22 2019

nonn

First differs from A327399 at a(24) = 4, A327399(24) = 3.

			The factorizations of 2, 4, 12, 24, 30, 36, 48, and 60 that are constant or whose factors are relatively prime:
  2   4     12      24        30      36        48          60
      2*2   3*4     3*8       5*6     4*9       3*16        3*20
            2*2*3   2*3*4     2*15    6*6       2*3*8       4*15
                    2*2*2*3   3*10    2*2*9     3*4*4       5*12
                              2*3*5   2*3*6     2*2*3*4     2*5*6
                                      3*3*4     2*2*2*2*3   3*4*5
                                      2*2*3*3               2*2*15
                                                            2*3*10
                                                            2*2*3*5

Constant factorizations are A089723.

Cf. A007359, A051424, A281116, A302569, A304709, A304711, A319269, A327399.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[Select[facs[n],#=={}||Length[Union[#]]==1||GCD@@#==1&]],{n,100}]

a(n) = A281116(n) + A089723(n).

A327695 Number of non-constant factorizations of n whose distinct factors are pairwise coprime.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 1, 0, 0, 2, 0, 2, 1, 1, 0, 2, 0, 1, 0, 2, 0, 4, 0, 0, 1, 1, 1, 4, 0, 1, 1, 2, 0, 4, 0, 2, 2, 1, 0, 3, 0, 2, 1, 2, 0, 2, 1, 2, 1, 1, 0, 6, 0, 1, 2, 0, 1, 4, 0, 2, 1, 4, 0, 4, 0, 1, 2, 2, 1, 4, 0, 3, 0, 1, 0, 6, 1, 1, 1

Offset: 1

Gus Wiseman, Sep 22 2019

nonn

			The factorizations of 6, 12, 30, 48, 60, 180, and 210:
  (2*3)  (3*4)    (5*6)    (3*16)       (3*20)     (4*45)       (3*70)
         (2*2*3)  (2*15)   (3*4*4)      (4*15)     (5*36)       (5*42)
                  (3*10)   (2*2*2*2*3)  (5*12)     (9*20)       (6*35)
                  (2*3*5)               (3*4*5)    (4*5*9)      (7*30)
                                        (2*2*15)   (5*6*6)      (10*21)
                                        (2*2*3*5)  (2*2*45)     (14*15)
                                                   (3*3*20)     (2*105)
                                                   (2*2*5*9)    (5*6*7)
                                                   (3*3*4*5)    (2*3*35)
                                                   (2*2*3*3*5)  (2*5*21)
                                                                (2*7*15)
                                                                (3*5*14)
                                                                (3*7*10)
                                                                (2*3*5*7)

Factorizations that are constant or whose distinct parts are pairwise coprime are counted by A327399.
Numbers with pairwise coprime distinct prime indices are A304711.
Cf. A001055, A089723, A281116, A318721, A302569, A319269, A327407, A327517.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[Select[facs[n],CoprimeQ@@Union[#]&]],{n,100}]

a(n) = A327399(n) - A089723(n).

cp's OEIS Frontend

A259936 Number of ways to express the integer n as a product of its unitary divisors (A034444).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A326783 BII-numbers of uniform set-systems.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A336618 Maximum divisor of n! with equal prime multiplicities.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A336619 a(n) = n!/d where d is the maximum divisor of n! with equal prime exponents.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A320888 Number of set multipartitions (multisets of sets) of factorizations of n into factors > 1 such that all the parts have the same product.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A327400 Number of factorizations of n that are constant or whose factors are relatively prime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A327695 Number of non-constant factorizations of n whose distinct factors are pairwise coprime.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula