A338331 -id:A338331 - cp's OEIS frontend

A100565 a(n) = Card{(x,y,z) : x <= y <= z, x|n, y|n, z|n, gcd(x,y)=1, gcd(x,z)=1, gcd(y,z)=1}.

1, 2, 2, 3, 2, 5, 2, 4, 3, 5, 2, 8, 2, 5, 5, 5, 2, 8, 2, 8, 5, 5, 2, 11, 3, 5, 4, 8, 2, 15, 2, 6, 5, 5, 5, 13, 2, 5, 5, 11, 2, 15, 2, 8, 8, 5, 2, 14, 3, 8, 5, 8, 2, 11, 5, 11, 5, 5, 2, 25, 2, 5, 8, 7, 5, 15, 2, 8, 5, 15, 2, 18, 2, 5, 8, 8, 5, 15, 2, 14, 5, 5, 2, 25, 5, 5, 5, 11, 2, 25, 5, 8, 5, 5, 5, 17

Offset: 1

Vladeta Jovovic, Nov 28 2004

First differs from A018892 at a(30) = 15, A018892(30) = 14.
First differs from A343654 at a(210) = 51, A343654(210) = 52.
Also a(n) = Card{(x,y,z) : x <= y <= z and lcm(x,y)=n, lcm(x,z)=n, lcm(y,z)=n}.
In words, a(n) is the number of pairwise coprime unordered triples of divisors of n. - Gus Wiseman, May 01 2021

			From _Gus Wiseman_, May 01 2021: (Start)
The a(n) triples for n = 1, 2, 4, 6, 8, 12, 24:
  (1,1,1)  (1,1,1)  (1,1,1)  (1,1,1)  (1,1,1)  (1,1,1)   (1,1,1)
           (1,1,2)  (1,1,2)  (1,1,2)  (1,1,2)  (1,1,2)   (1,1,2)
                    (1,1,4)  (1,1,3)  (1,1,4)  (1,1,3)   (1,1,3)
                             (1,1,6)  (1,1,8)  (1,1,4)   (1,1,4)
                             (1,2,3)           (1,1,6)   (1,1,6)
                                               (1,2,3)   (1,1,8)
                                               (1,3,4)   (1,2,3)
                                               (1,1,12)  (1,3,4)
                                                         (1,3,8)
                                                         (1,1,12)
                                                         (1,1,24)
(End)

Antti Karttunen, Table of n, a(n) for n = 1..10000

Cf. A000005, A070919, A086222, A086165, A048691, A063647.
Positions of 2's through 5's are A000040, A001248, A030078, A068993.
The version for subsets of {1..n} instead of divisors is A015617.
The version for pairs of divisors is A018892.
The ordered version is A048785.
The strict case is A066620.
The version for strict partitions is A220377.
A version for sets of divisors of any size is A225520.
The version for partitions is A307719 (no 1's: A337563).
The case of distinct parts coprime is A337600 (ordered: A337602).
A001399(n-3) = A069905(n) = A211540(n+2) counts 3-part partitions.
A007304 ranks 3-part strict partitions.
A014311 ranks 3-part compositions.
A014612 ranks 3-part partitions.
A051026 counts pairwise indivisible subsets of {1..n}.
A302696 lists Heinz numbers of pairwise coprime partitions.
A337461 counts 3-part pairwise coprime compositions.
Cf. A000961, A000977, A007360, A023022, A087087, A276187, A282935, A337601, A337603, A338331, A343652, A343654.

pwcop[y_]:=And@@(GCD@@#==1&/@Subsets[y,{2}]);
Table[Length[Select[Tuples[Divisors[n],3],LessEqual@@#&&pwcop[#]&]],{n,30}] (* Gus Wiseman, May 01 2021 *)

A100565(n) = (numdiv(n^3)+3*numdiv(n)+2)/6; \\ Antti Karttunen, May 19 2017

a(n) = (tau(n^3) + 3*tau(n) + 2)/6.

A066620 Number of unordered triples of distinct pairwise coprime divisors of n.

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, 3, 0, 1, 0, 2, 0, 7, 0, 0, 1, 1, 1, 4, 0, 1, 1, 3, 0, 7, 0, 2, 2, 1, 0, 4, 0, 2, 1, 2, 0, 3, 1, 3, 1, 1, 0, 13, 0, 1, 2, 0, 1, 7, 0, 2, 1, 7, 0, 6, 0, 1, 2, 2, 1, 7, 0, 4, 0, 1, 0, 13, 1, 1, 1, 3, 0, 13, 1, 2, 1, 1, 1, 5, 0, 2, 2, 4, 0, 7, 0

Offset: 1

K. B. Subramaniam (kb_subramaniambalu(AT)yahoo.com) and Amarnath Murthy, Dec 24 2001

nonn

a(m) = a(n) if m and n have same factorization structure.

			a(24) = 3: the divisors of 24 are 1, 2, 3, 4, 6, 8, 12 and 24. The triples are (1, 2, 3), (1, 2, 9), (1, 3, 4).
a(30) = 7: the triples are (1, 2, 3), (1, 2, 5), (1, 3, 5), (2, 3, 5), (1, 3, 10), (1, 5, 6), (1, 2, 15).

Amarnath Murthy, Decomposition of the divisors of a natural number into pairwise coprime sets, Smarandache Notions Journal, vol. 12, No. 1-2-3, Spring 2001.pp 303-306.

Antti Karttunen, Table of n, a(n) for n = 1..10000

Positions of zeros are A000961.
Positions of ones are A006881.
The version for subsets of {1..n} instead of divisors is A015617.
The non-strict ordered version is A048785.
The version for pairs of divisors is A063647.
The non-strict version (3-multisets) is A100565.
The version for partitions is A220377 (non-strict: A307719).
A version for sets of divisors of any size is A225520.
A000005 counts divisors.
A001399(n-3) = A069905(n) = A211540(n+2) counts 3-part partitions.
A007304 ranks 3-part strict partitions.
A014311 ranks 3-part compositions.
A014612 ranks 3-part partitions.
A018892 counts unordered pairs of coprime divisors (ordered: A048691).
A051026 counts pairwise indivisible subsets of {1..n}.
A337461 counts 3-part pairwise coprime compositions.
A338331 lists Heinz numbers of pairwise coprime partitions.
Cf. A007360, A023022, A084422, A276187, A282935, A305713, A337563, A337605, A343652, A343655.

Table[Length[Select[Subsets[Divisors[n],{3}],CoprimeQ@@#&]],{n,100}] (* Gus Wiseman, Apr 28 2021 *)

A066620(n) = (numdiv(n^3)-3*numdiv(n)+2)/6; \\ After Jovovic's formula. - Antti Karttunen, May 27 2017

from sympy import divisor_count as d
def a(n): return (d(n**3) - 3*d(n) + 2)/6 # Indranil Ghosh, May 27 2017

In the reference it is shown that if k is a squarefree number with r prime factors and m with (r+1) prime factors then a(m) = 4*a(k) + 2^k - 1.

a(n) = (tau(n^3)-3*tau(n)+2)/6. - Vladeta Jovovic, Nov 27 2004

More terms from Vladeta Jovovic, Apr 03 2003
Name corrected by Andrey Zabolotskiy, Dec 09 2020
Name corrected by Gus Wiseman, Apr 28 2021 (ordered version is 6*a(n))

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.

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.

A338555 Numbers that are either a power of a prime or have relatively prime prime indices.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 58, 59, 60, 61, 62, 64, 66, 67, 68, 69, 70, 71, 72

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 partitions either constant or relatively prime (A338553). 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.

A327534 uses primes instead of prime powers.
A338331 is the pairwise coprime version, with complement A338330.
A338552 is the complement.
A338553 counts the partitions with these Heinz numbers.
A000837 counts relatively prime partitions, with Heinz numbers A289509.
A000961 lists powers of primes.
A018783 counts partitions whose prime indices are not relatively prime, with Heinz numbers A318978.
A051424 counts pairwise coprime or singleton partitions.
A291166 ranks relatively prime compositions, with complement A291165.
A327516 counts pairwise coprime partitions, with Heinz numbers A302696.
Cf. A000740, A056239, A108572, A112798, A302569, A302796, A327685, A328677.

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

Equals A000961 \/ A289509.

Complement of A024619 /\ A318978.

cp's OEIS Frontend

A100565 a(n) = Card{(x,y,z) : x <= y <= z, x|n, y|n, z|n, gcd(x,y)=1, gcd(x,z)=1, gcd(y,z)=1}.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A066620 Number of unordered triples of distinct pairwise coprime divisors of n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

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

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A338555 Numbers that are either a power of a prime or have relatively prime prime indices.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula