A327658 -id:A327658 - 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

A327685 Nonprime numbers whose prime indices have a common divisor > 1.

Original entry on oeis.org

9, 21, 25, 27, 39, 49, 57, 63, 65, 81, 87, 91, 111, 115, 117, 121, 125, 129, 133, 147, 159, 169, 171, 183, 185, 189, 203, 213, 235, 237, 243, 247, 259, 261, 267, 273, 289, 299, 301, 303, 305, 319, 321, 325, 333, 339, 343, 351, 361, 365, 371, 377, 387, 393, 399

Offset: 1

Gus Wiseman, Sep 22 2019

nonn

First differs from A322336 in lacking 2535 = prime(2)*prime(3)*prime(6)^2.

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. Heinz numbers of integer partitions with a common divisor > 1 are A318978, and the enumeration of these partitions by sum is A108572.

			The sequence of terms together with their prime indices begins:
    9: {2,2}
   21: {2,4}
   25: {3,3}
   27: {2,2,2}
   39: {2,6}
   49: {4,4}
   57: {2,8}
   63: {2,2,4}
   65: {3,6}
   81: {2,2,2,2}
   87: {2,10}
   91: {4,6}
  111: {2,12}
  115: {3,9}
  117: {2,2,6}
  121: {5,5}
  125: {3,3,3}
  129: {2,14}
  133: {4,8}
  147: {2,4,4}

Cf. A000837, A007916, A018783, A056239, A108572, A112798, A289509, A318978, A327407, A327658.

Select[Range[100],#>1&&!PrimeQ[#]&&GCD@@PrimePi/@First/@FactorInteger[#]>1&]

Complement of A000040 in A318978.

A338552 Non-powers of primes whose prime indices have a common divisor > 1.

Original entry on oeis.org

21, 39, 57, 63, 65, 87, 91, 111, 115, 117, 129, 133, 147, 159, 171, 183, 185, 189, 203, 213, 235, 237, 247, 259, 261, 267, 273, 299, 301, 303, 305, 319, 321, 325, 333, 339, 351, 365, 371, 377, 387, 393, 399, 417, 427, 441, 445, 453, 477, 481, 489, 497, 507

Offset: 1

Gus Wiseman, Nov 03 2020

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

Also Heinz numbers of non-constant, non-relatively prime partitions. The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), giving a bijective correspondence between positive integers and integer partitions.

			The sequence of terms together with their prime indices begins:
     21: {2,4}      183: {2,18}       305: {3,18}
     39: {2,6}      185: {3,12}       319: {5,10}
     57: {2,8}      189: {2,2,2,4}    321: {2,28}
     63: {2,2,4}    203: {4,10}       325: {3,3,6}
     65: {3,6}      213: {2,20}       333: {2,2,12}
     87: {2,10}     235: {3,15}       339: {2,30}
     91: {4,6}      237: {2,22}       351: {2,2,2,6}
    111: {2,12}     247: {6,8}        365: {3,21}
    115: {3,9}      259: {4,12}       371: {4,16}
    117: {2,2,6}    261: {2,2,10}     377: {6,10}
    129: {2,14}     267: {2,24}       387: {2,2,14}
    133: {4,8}      273: {2,4,6}      393: {2,32}
    147: {2,4,4}    299: {6,9}        399: {2,4,8}
    159: {2,16}     301: {4,14}       417: {2,34}
    171: {2,2,8}    303: {2,26}       427: {4,18}

A318978 allows prime powers, counted by A018783, with complement A289509.
A327685 allows nonprime prime powers.
A338330 is the coprime instead of relatively prime version.
A338554 counts the partitions with these Heinz numbers.
A338555 is the complement.
A000740 counts relatively prime compositions.
A000961 lists powers of primes, with complement A024619.
A051424 counts pairwise coprime or singleton partitions.
A108572 counts nontrivial periodic partitions, with Heinz numbers A001597.
A291166 ranks relatively prime compositions, with complement A291165.
A302696 gives the Heinz numbers of pairwise coprime partitions.
A327516 counts pairwise coprime partitions, with Heinz numbers A302696.
Cf. A000005, A000837, A007916, A056239, A112798, A289508, A302569, A302796, A318716, A327658, A328867, A328677, A338331, A338553.

Select[Range[100],!(#==1||PrimePowerQ[#]||GCD@@PrimePi/@First/@FactorInteger[#]==1)&]

Equals A024619 /\ A318978.

Complement of A000961 \/ A289509.

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

A327685 Nonprime numbers whose prime indices have a common divisor > 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A338552 Non-powers of primes whose prime indices have a common divisor > 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula