A304711 -id:A304711 - cp's OEIS frontend

A327513 Number of divisors of n that are 1, 2, or a nonprime number whose prime indices are pairwise coprime.

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

Offset: 1

Gus Wiseman, Sep 19 2019

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. Numbers that are 1, 2, or a nonprime number whose prime indices are pairwise coprime are listed in A302696.
Note that the maximum odd divisor of any entry must be squarefree.
Number of terms of A302696 that divide n. Put in other words, this sequence is the inverse Möbius transform of the characteristic function of A302696. - Antti Karttunen, Dec 06 2021

			The divisors of 72 that are 1, 2, or nonprime numbers whose prime indices are pairwise coprime are: {1, 2, 4, 6, 8, 12, 24}, so a(72) = 7.

Antti Karttunen, Table of n, a(n) for n = 1..20000
Gus Wiseman, Sequences counting and encoding certain classes of multisets
Index entries for sequences computed from indices in prime factorization

See link for additional cross-references.

Cf. A000005, A056239, A112798, A302569, A302696, A304711.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[Divisors[n],#==1||CoprimeQ@@primeMS[#]&]],{n,100}]

isA302696(n) = if(isprimepower(n),!(n%2), if(!issquarefree(n>>valuation(n,2)), 0, my(pis=apply(primepi,factor(n)[,1])); (lcm(pis)==factorback(pis))));
A327513(n) = sumdiv(n,d,isA302696(d)); \\ Antti Karttunen, Dec 06 2021

Data section extended up to 105 terms by Antti Karttunen, Dec 06 2021

A338316 Odd numbers whose distinct prime indices are pairwise coprime, where a singleton is always considered coprime.

Original entry on oeis.org

1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 23, 25, 27, 29, 31, 33, 35, 37, 41, 43, 45, 47, 49, 51, 53, 55, 59, 61, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 89, 93, 95, 97, 99, 101, 103, 107, 109, 113, 119, 121, 123, 125, 127, 131, 135, 137, 139, 141, 143, 145, 149, 151

Offset: 1

Gus Wiseman, Oct 24 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.

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), giving a bijective correspondence between positive integers and integer partitions. a(n) gives the n-th Heinz number of an integer partition with no 1's and pairwise coprime distinct parts, where a singleton is always considered coprime (A338317).

			The sequence of terms together with their prime indices begins:
      1: {}          33: {2,5}       71: {20}
      3: {2}         35: {3,4}       73: {21}
      5: {3}         37: {12}        75: {2,3,3}
      7: {4}         41: {13}        77: {4,5}
      9: {2,2}       43: {14}        79: {22}
     11: {5}         45: {2,2,3}     81: {2,2,2,2}
     13: {6}         47: {15}        83: {23}
     15: {2,3}       49: {4,4}       85: {3,7}
     17: {7}         51: {2,7}       89: {24}
     19: {8}         53: {16}        93: {2,11}
     23: {9}         55: {3,5}       95: {3,8}
     25: {3,3}       59: {17}        97: {25}
     27: {2,2,2}     61: {18}        99: {2,2,5}
     29: {10}        67: {19}       101: {26}
     31: {11}        69: {2,9}      103: {27}

A338315 does not consider singletons coprime, with Heinz numbers A337987.
A338317 counts the partitions with these Heinz numbers.
A337694 is a pairwise non-coprime instead of pairwise coprime version.
A007359 counts singleton or pairwise coprime partitions with no 1's, with Heinz numbers A302568.
A101268 counts pairwise coprime or singleton compositions, ranked by A335235.
A302797 lists squarefree numbers whose distinct parts are pairwise coprime.
A304709 counts partitions whose distinct parts are pairwise coprime, with Heinz numbers A304711.
A327516 counts pairwise coprime partitions, ranked by A302696.
A337485 counts pairwise coprime partitions with no 1's, with Heinz numbers A337984.
A337561 counts pairwise coprime strict compositions.
A337665 counts compositions whose distinct parts are pairwise coprime, ranked by A333228.
A337697 counts pairwise coprime compositions with no 1's.
Cf. A051424, A056239, A112798, A220377, A289509, A302569, A303282, A318719, A328673, A328867.

Select[Range[1,100,2],#==1||PrimePowerQ[#]||CoprimeQ@@Union[PrimePi/@First/@FactorInteger[#]]&]

A338317 Number of integer partitions of n with no 1's and pairwise coprime distinct parts, where a singleton is always considered coprime.

Original entry on oeis.org

1, 0, 1, 1, 2, 2, 3, 4, 5, 6, 7, 11, 11, 16, 16, 19, 25, 32, 34, 44, 46, 53, 66, 80, 88, 101, 116, 132, 150, 180, 204, 229, 254, 287, 331, 366, 426, 473, 525, 584, 662, 742, 835, 922, 1013, 1128, 1262, 1408, 1555, 1711, 1894, 2080, 2297, 2555, 2806, 3064, 3376

Offset: 0

Gus Wiseman, Oct 24 2020

nonn

			The a(2) = 1 through a(12) = 11 partitions (A = 10, B = 11, C = 12):
  2   3   4    5    6     7     8      9      A       B       C
          22   32   33    43    44     54     55      65      66
                    222   52    53     72     73      74      75
                          322   332    333    433     83      444
                                2222   522    532     92      543
                                       3222   3322    443     552
                                              22222   533     732
                                                      722     3333
                                                      3332    5322
                                                      5222    33222
                                                      32222   222222

A007359 (A302568) gives the strict case.
A101268 (A335235) gives pairwise coprime or singleton compositions.
A200976 (A338318) gives the pairwise non-coprime instead of coprime version.
A304709 (A304711) gives partitions whose distinct parts are pairwise coprime, with strict case A305713 (A302797).
A304712 (A338331) allows 1's, with strict version A007360 (A302798).
A327516 (A302696) gives pairwise coprime partitions.
A328673 (A328867) gives partitions with no distinct relatively prime parts.
A338315 (A337987) does not consider singletons coprime.
A338317 (A338316) gives these partitions.
A337462 (A333227) gives pairwise coprime compositions.
A337485 (A337984) gives pairwise coprime integer partitions with no 1's.
A337665 (A333228) gives compositions with pairwise coprime distinct parts.
A337667 (A337666) gives pairwise non-coprime compositions.
A337697 (A022340 /\ A333227) = pairwise coprime compositions with no 1's.
A337983 (A337696) gives pairwise non-coprime strict compositions, with unordered version A318717 (A318719).
Cf. A051424, A289508, A302569, A303140, A337694.

Table[Length[Select[IntegerPartitions[n],!MemberQ[#,1]&&(SameQ@@#||CoprimeQ@@Union[#])&]],{n,0,15}]

The Heinz numbers of these partitions are given by A338316. The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), giving a bijective correspondence between positive integers and integer partitions.

A338330 Numbers that are neither a power of a prime (A000961) nor is their set of distinct prime indices pairwise coprime.

Original entry on oeis.org

21, 39, 42, 57, 63, 65, 78, 84, 87, 91, 105, 111, 114, 115, 117, 126, 129, 130, 133, 147, 156, 159, 168, 171, 174, 182, 183, 185, 189, 195, 203, 210, 213, 222, 228, 230, 231, 234, 235, 237, 247, 252, 258, 259, 260, 261, 266, 267, 273, 285, 294, 299, 301

Offset: 1

Gus Wiseman, Nov 12 2020

nonn

Also Heinz numbers of partitions that are neither constant (A144300) nor have pairwise coprime distinct parts (A304709), hence the formula. 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}        126: {1,2,2,4}      203: {4,10}
     39: {2,6}        129: {2,14}         210: {1,2,3,4}
     42: {1,2,4}      130: {1,3,6}        213: {2,20}
     57: {2,8}        133: {4,8}          222: {1,2,12}
     63: {2,2,4}      147: {2,4,4}        228: {1,1,2,8}
     65: {3,6}        156: {1,1,2,6}      230: {1,3,9}
     78: {1,2,6}      159: {2,16}         231: {2,4,5}
     84: {1,1,2,4}    168: {1,1,1,2,4}    234: {1,2,2,6}
     87: {2,10}       171: {2,2,8}        235: {3,15}
     91: {4,6}        174: {1,2,10}       237: {2,22}
    105: {2,3,4}      182: {1,4,6}        247: {6,8}
    111: {2,12}       183: {2,18}         252: {1,1,2,2,4}
    114: {1,2,8}      185: {3,12}         258: {1,2,14}
    115: {3,9}        189: {2,2,2,4}      259: {4,12}
    117: {2,2,6}      195: {2,3,6}        260: {1,1,3,6}

A338331 is the complement.
A304713 is the complement of the version for divisibility.
Cf. A056239, A112798, A289509, A303282, A316476, A318716, A318719, A328867.

Select[Range[2,100],!PrimePowerQ[#]&&!CoprimeQ@@Union[PrimePi/@First/@FactorInteger[#]]&]

Equals A024619 \ A304711.

A327515 Number of steps to reach a fixed point starting with n and repeatedly taking the quotient by the maximum divisor that is 1, 2, or a nonprime number whose prime indices are pairwise coprime (A327512, A327514).

Original entry on oeis.org

0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1

Offset: 1

Gus Wiseman, Sep 19 2019

nonn

Positions of zeros are A289509.
First term > 1 is a(225) = 2.
First zero not in A318978 is a(17719) = 0.
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. Numbers that are 1, 2, or a nonprime number whose prime indices are pairwise coprime are listed in A302696.

			We have 50625 -> 3375 -> 225 ->  15 -> 1, so a(50625) = 4.

Antti Karttunen, Table of n, a(n) for n = 1..65537
Gus Wiseman, Sequences counting and encoding certain classes of multisets
Index entries for sequences related to prime indices in the factorization of n.

See link for additional cross-references.

Cf. A000005, A006530, A056239, A112798, A289509, A302569, A302696, A304711.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[FixedPointList[#/Max[Select[Divisors[#],#==1||CoprimeQ@@primeMS[#]&]]&,n]]-2,{n,100}]

isA302696(n) = if(isprimepower(n), !(n%2), if(!issquarefree(n>>valuation(n, 2)), 0, my(pis=apply(primepi, factor(n)[, 1])); (lcm(pis)==factorback(pis))));
A327512(n) = vecmax(select(isA302696, divisors(n)));
A327515(n) = for(k=0,oo,my(nextn=n/A327512(n)); if(nextn==n,return(k)); n = nextn); \\ Antti Karttunen, Jan 28 2025

a(15^n) = n.

Data section extended to a(105) and secondary offset added by Antti Karttunen, Jan 28 2025

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).

A327401 Quotient of n over the maximum divisor of n that is 1, prime, or whose prime indices are pairwise coprime.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 5, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 1, 7, 5, 1, 1, 1, 9, 1, 1, 3, 1, 1, 1, 1, 1, 9, 1, 5, 1, 1, 1, 1, 1, 1, 3, 1, 1, 5, 1, 1, 3, 1, 1, 27, 1, 1, 3, 1, 1, 3

Offset: 1

Gus Wiseman, Sep 20 2019

nonn

All terms are odd.

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. Numbers > 1 that are prime or whose prime indices are pairwise coprime are listed in A302569.

			The divisors of 84 that are 1, prime, or whose prime indices are pairwise coprime are {1, 2, 3, 4, 6, 7, 12, 14, 28}, so a(84) = 84/28 = 3.

Gus Wiseman, Sequences counting and encoding certain classes of multisets

See link for additional cross-references.

Cf. A000005, A006530, A056239, A112798, A302569, A304711.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[n/Max[Select[Divisors[n],#==1||PrimeQ[#]||CoprimeQ@@primeMS[#]&]],{n,100}]

A327514 Quotient of n over the maximum divisor of n that is 1, 2, or a nonprime number whose prime indices are pairwise coprime.

Original entry on oeis.org

1, 1, 3, 1, 5, 1, 7, 1, 9, 1, 11, 1, 13, 1, 1, 1, 17, 3, 19, 1, 21, 1, 23, 1, 25, 1, 27, 1, 29, 1, 31, 1, 1, 1, 1, 3, 37, 1, 39, 1, 41, 3, 43, 1, 3, 1, 47, 1, 49, 5, 1, 1, 53, 9, 1, 1, 57, 1, 59, 1, 61, 1, 63, 1, 65, 1, 67, 1, 1, 1, 71, 3, 73, 1, 5, 1, 1, 3

Offset: 1

Gus Wiseman, Sep 19 2019

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. Numbers that are 1, 2, or a nonprime number whose prime indices are pairwise coprime are listed in A302696.

			The divisors of 72 that are 1, 2, or nonprime numbers whose prime indices are pairwise coprime are: {1, 2, 4, 6, 8, 12, 24}, so a(72) = 72/24 = 3.

Gus Wiseman, Sequences counting and encoding certain classes of multisets

See link for additional cross-references.

Cf. A000005, A006530, A056239, A112798, A302569, A302696, A304711.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[n/Max[Select[Divisors[n],#==1||CoprimeQ@@primeMS[#]&]],{n,100}]

A327391 Number of divisors of n that are 1, prime, or whose prime indices are pairwise coprime.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Sep 20 2019

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. Numbers that are prime or whose prime indices are pairwise coprime are listed in A302569.

			The divisors of 84 that are 1, prime, or whose prime indices are pairwise coprime are {1, 2, 3, 4, 6, 7, 12, 14, 28}, so a(84) = 9.

Gus Wiseman, Sequences counting and encoding certain classes of multisets

See link for additional cross-references.

Cf. A000005, A006530, A033273, A056239, A112798, A302569, A304711, A327513.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[Divisors[n],#==1||PrimeQ[#]||CoprimeQ@@primeMS[#]&]],{n,100}]

A327518 Number of factorizations of A302696(n), the n-th number that is 1, 2, or a nonprime number with pairwise coprime prime indices, into factors > 1 satisfying the same conditions.

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 2, 1, 1, 5, 2, 1, 4, 1, 2, 2, 7, 1, 1, 1, 1, 4, 2, 1, 7, 1, 2, 1, 4, 1, 5, 1, 11, 2, 2, 1, 2, 1, 2, 1, 7, 1, 1, 1, 4, 2, 1, 1, 1, 12, 2, 4, 1, 2, 7, 2, 1, 1, 10, 1, 1, 2, 15, 5, 1, 4, 2, 5, 1, 1, 1, 1, 1, 2, 4, 2, 1, 1, 12, 1, 2, 1, 1, 2, 2

Offset: 1

Gus Wiseman, Sep 19 2019

nonn

			The a(59) = 10 factorizations of 120 using the allowed factors, together with the corresponding multiset partitions of {1,1,1,2,3}:
  (2*2*2*15)  {{1},{1},{1},{2,3}}
  (2*2*30)    {{1},{1},{1,2,3}}
  (2*4*15)    {{1},{1,1},{2,3}}
  (2*6*10)    {{1},{1,2},{1,3}}
  (2*60)      {{1},{1,1,2,3}}
  (4*30)      {{1,1},{1,2,3}}
  (6*20)      {{1,2},{1,1,3}}
  (8*15)      {{1,1,1},{2,3}}
  (10*12)     {{1,3},{1,1,2}}
  (120)       {{1,1,1,2,3}}

Gus Wiseman, Sequences counting and encoding certain classes of multisets

See link for additional cross-references.

Cf. A001055, A056239, A112798, A302569, A302696, A304711, A305079, A327392.

nn=100;
facsusing[s_,n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facsusing[Select[s,Divisible[n/d,#]&],n/d],Min@@#>=d&]],{d,Select[s,Divisible[n,#]&]}]];
y=Select[Range[nn],#==1||CoprimeQ@@primeMS[#]&];
Table[Length[facsusing[Rest[y],n]],{n,y}]

cp's OEIS Frontend

A327513 Number of divisors of n that are 1, 2, or a nonprime number whose prime indices are pairwise coprime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A338316 Odd numbers whose distinct prime indices are pairwise coprime, where a singleton is always considered coprime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A338317 Number of integer partitions of n with no 1's and pairwise coprime distinct parts, where a singleton is always considered coprime.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A338330 Numbers that are neither a power of a prime (A000961) nor is their set of distinct prime indices pairwise coprime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A327515 Number of steps to reach a fixed point starting with n and repeatedly taking the quotient by the maximum divisor that is 1, 2, or a nonprime number whose prime indices are pairwise coprime (A327512, A327514).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

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

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A327401 Quotient of n over the maximum divisor of n that is 1, prime, or whose prime indices are pairwise coprime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A327514 Quotient of n over the maximum divisor of n that is 1, 2, or a nonprime number whose prime indices are pairwise coprime.

Views

Author

Keywords

Comments

Examples

Links