A302569 -id:A302569 - cp's OEIS frontend

A337984 Heinz numbers of pairwise coprime integer partitions with no 1's, where a singleton is not considered coprime.

15, 33, 35, 51, 55, 69, 77, 85, 93, 95, 119, 123, 141, 143, 145, 155, 161, 165, 177, 187, 201, 205, 209, 215, 217, 219, 221, 249, 253, 255, 265, 287, 291, 295, 309, 323, 327, 329, 335, 341, 355, 381, 385, 391, 395, 403, 407, 411, 413, 415, 437, 447, 451, 465

Offset: 1

Gus Wiseman, Oct 22 2020

nonn

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

			The sequence of terms together with their prime indices begins:
     15: {2,3}     155: {3,11}     265: {3,16}
     33: {2,5}     161: {4,9}      287: {4,13}
     35: {3,4}     165: {2,3,5}    291: {2,25}
     51: {2,7}     177: {2,17}     295: {3,17}
     55: {3,5}     187: {5,7}      309: {2,27}
     69: {2,9}     201: {2,19}     323: {7,8}
     77: {4,5}     205: {3,13}     327: {2,29}
     85: {3,7}     209: {5,8}      329: {4,15}
     93: {2,11}    215: {3,14}     335: {3,19}
     95: {3,8}     217: {4,11}     341: {5,11}
    119: {4,7}     219: {2,21}     355: {3,20}
    123: {2,13}    221: {6,7}      381: {2,31}
    141: {2,15}    249: {2,23}     385: {3,4,5}
    143: {5,6}     253: {5,9}      391: {7,9}
    145: {3,10}    255: {2,3,7}    395: {3,22}

A005117 is a superset.
A337485 counts these partitions.
A302568 considers singletons to be coprime.
A304711 allows 1's, with squarefree version A302797.
A337694 is the pairwise non-coprime instead of pairwise coprime version.
A007359 counts partitions into singleton or pairwise coprime parts with no 1's
A101268 counts pairwise coprime or singleton compositions, ranked by A335235.
A305713 counts pairwise coprime strict partitions.
A327516 counts pairwise coprime partitions, ranked by A302696.
A337462 counts pairwise coprime compositions, ranked by A333227.
A337561 counts pairwise coprime strict compositions.
A337665 counts compositions whose distinct parts are pairwise coprime, ranked by A333228.
A337667 counts pairwise non-coprime compositions, ranked by A337666.
A337697 counts pairwise coprime compositions with no 1's.
A337983 counts pairwise non-coprime strict compositions, with unordered version A318717 ranked by A318719.
Cf. A051424, A056239, A087087, A112798, A200976, A220377, A302569, A303140, A303282, A328673, A328867.

Select[Range[1,100,2],SquareFreeQ[#]&&CoprimeQ@@PrimePi/@First/@FactorInteger[#]&]

Equals A302568\A000040.

A320423 Number of set partitions of {1,...,n} where each block's elements are pairwise coprime.

Original entry on oeis.org

1, 1, 1, 2, 2, 8, 4, 28, 18, 120, 60, 888, 252, 5220, 1860, 22224, 9552, 311088, 59616, 2473056, 565920, 13627008, 4051872, 235039392, 33805440, 1932037632, 465239808, 20604487680, 4294865664, 386228795904, 35413136640

Offset: 0

Gus Wiseman, Jan 08 2019

Two or more numbers are pairwise coprime if no pair of them has a common divisor > 1. A single number is not considered to be pairwise coprime unless it is equal to 1.

			The a(5) = 8 set partitions:
  {{1},{2,3},{4,5}}
  {{1},{2,5},{3,4}}
   {{1,2},{3,4,5}}
   {{1,4},{2,3,5}}
   {{1,2,3},{4,5}}
   {{1,2,5},{3,4}}
   {{1,3,4},{2,5}}
   {{1,4,5},{2,3}}

Cf. A000110, A051424, A084422, A085945, A186974, A187106, A302569, A302696, A303139, A303140, A320424, A320426, A320430, A320768.

spsu[,{}]:={{}};spsu[foo,set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@spsu[Select[foo,Complement[#,Complement[set,s]]=={}&],Complement[set,s]]]/@Cases[foo,{i,_}];
Table[Length[spsu[Select[Subsets[Range[n]],CoprimeQ@@#&],Range[n]]],{n,10}]

a(17)-a(18) from Alois P. Heinz, Jan 17 2019

a(19)-a(30) from Christian Sievers, Nov 28 2024

A335237 Numbers whose binary indices are not a singleton nor pairwise coprime.

Original entry on oeis.org

0, 10, 11, 14, 15, 26, 27, 30, 31, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 74, 75, 78, 79, 90, 91, 94, 95, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 114, 115, 116

Offset: 1

Gus Wiseman, May 28 2020

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.

			The sequence of terms together with their binary expansions and binary indices begins:
    0:       0 ~ {}
   10:    1010 ~ {2,4}
   11:    1011 ~ {1,2,4}
   14:    1110 ~ {2,3,4}
   15:    1111 ~ {1,2,3,4}
   26:   11010 ~ {2,4,5}
   27:   11011 ~ {1,2,4,5}
   30:   11110 ~ {2,3,4,5}
   31:   11111 ~ {1,2,3,4,5}
   34:  100010 ~ {2,6}
   35:  100011 ~ {1,2,6}
   36:  100100 ~ {3,6}
   37:  100101 ~ {1,3,6}
   38:  100110 ~ {2,3,6}
   39:  100111 ~ {1,2,3,6}
   40:  101000 ~ {4,6}
   41:  101001 ~ {1,4,6}
   42:  101010 ~ {2,4,6}
   43:  101011 ~ {1,2,4,6}
   44:  101100 ~ {3,4,6}

The version for prime indices is A316438.
The version for standard compositions is A335236.
Numbers whose binary indices are pairwise coprime or a singleton: A087087.
Non-coprime partitions are counted by A335240.
All of the following pertain to compositions in standard order (A066099):
- Length is A000120.
- Sum is A070939.
- Product is A124758.
- Reverse is A228351
- GCD is A326674.
- Heinz number is A333219.
- LCM is A333226.
Cf. A007360, A048793, A051424, A101268, A291166, A302569, A326675, A333227, A333228, A335235, A335239.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[0,100],!(Length[bpe[#]]==1||CoprimeQ@@bpe[#])&]

Complement in A001477 of A326675 and A000079.

A320430 Number of set partitions of [n] where the elements of each non-singleton block are pairwise coprime.

Original entry on oeis.org

1, 1, 2, 5, 10, 37, 60, 295, 658, 2621, 5368, 38535, 66506, 551529, 1234264, 5004697, 13721836, 143935131, 256835337, 2971237021, 6485081140, 35162930303, 95872321543, 1315397878401, 2399236456202, 25866803180347, 72374386475590, 563368417647305, 1479943119911866

Offset: 0

Gus Wiseman, Jan 08 2019

nonn

Two or more numbers are pairwise coprime if no pair of them has a common divisor > 1.

			The a(4) = 10 set partitions: 1|2|3|4, 14|2|3, 13|2|4, 12|3|4, 1|23|4, 1|2|34, 134|2, 123|4, 14|23, 12|34.

Alois P. Heinz, Table of n, a(n) for n = 0..38

Cf. A000110, A000258, A008277, A051424, A085945, A186974, A187106, A302569, A303139, A320424, A320426, A320423, A333517.

spsu[,{}]:={{}};spsu[foo,set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@spsu[Select[foo,Complement[#,Complement[set,s]]=={}&],Complement[set,s]]]/@Cases[foo,{i,_}];
Table[Length[spsu[Select[Subsets[Range[n]],Length[#]==1||CoprimeQ@@#&],Range[n]]],{n,10}]

a(14)-a(15) from Alois P. Heinz, Jan 08 2019
a(16) from Alois P. Heinz, Mar 26 2020
a(17)-a(24) from Giovanni Resta, Mar 27 2020
a(25)-a(28) from Alois P. Heinz, Aug 03 2023

A327517 Number of factorizations of n that are empty or have at least two factors, all of which are > 1 and pairwise coprime.

Original entry on oeis.org

1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 4, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 4, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 4, 0, 1, 1, 0, 1, 4, 0, 1, 1, 4, 0, 1, 0, 1, 1, 1, 1, 4, 0, 1, 0, 1, 0, 4, 1, 1, 1

Offset: 1

Gus Wiseman, Sep 19 2019

nonn

Gus Wiseman, Sequences counting and encoding certain classes of multisets

See link for additional cross-references.

Cf. A302569, A302696, A304711, A305079, A327076, A327392.

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@@#&]],{n,100}]

a(n > 1) = A259936(n) - 1 = A000110(A001221(n)) - 1.

A327534 Numbers that are 1, prime, or whose prime indices are relatively prime.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Sep 17 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 whose prime indices are relatively prime are A289509.

			91 = 7 * 13 has prime indices {4,6}, which have a common divisor of 2, so 91 is not in the sequence.

Gus Wiseman, Sequences counting and encoding certain classes of multisets

See link for additional cross-references.
Complement of A327407.
Cf. A056239, A112798, A281116, A289509, A302569.

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

Equals the union of {1}, A000040, and A289509.

A337695 Numbers k such that the distinct parts of the k-th composition in standard order (A066099) are not pairwise coprime, where a singleton is always considered coprime.

Original entry on oeis.org

34, 40, 69, 70, 81, 88, 98, 104, 130, 138, 139, 141, 142, 160, 162, 163, 168, 177, 184, 197, 198, 209, 216, 226, 232, 260, 261, 262, 274, 276, 277, 278, 279, 282, 283, 285, 286, 288, 290, 296, 321, 324, 325, 326, 327, 328, 337, 344, 352, 354, 355, 360, 369

Offset: 1

Gus Wiseman, Sep 22 2020

nonn

The k-th composition in standard order (graded reverse-lexicographic, A066099) is obtained by taking the set of positions of 1's in the reversed binary expansion of k, prepending 0, taking first differences, and reversing again. This gives a bijective correspondence between nonnegative integers and integer compositions.

			The sequence together with the corresponding compositions begins:
     34: (4,2)        163: (2,4,1,1)    277: (4,2,2,1)
     40: (2,4)        168: (2,2,4)      278: (4,2,1,2)
     69: (4,2,1)      177: (2,1,4,1)    279: (4,2,1,1,1)
     70: (4,1,2)      184: (2,1,1,4)    282: (4,1,2,2)
     81: (2,4,1)      197: (1,4,2,1)    283: (4,1,2,1,1)
     88: (2,1,4)      198: (1,4,1,2)    285: (4,1,1,2,1)
     98: (1,4,2)      209: (1,2,4,1)    286: (4,1,1,1,2)
    104: (1,2,4)      216: (1,2,1,4)    288: (3,6)
    130: (6,2)        226: (1,1,4,2)    290: (3,4,2)
    138: (4,2,2)      232: (1,1,2,4)    296: (3,2,4)
    139: (4,2,1,1)    260: (6,3)        321: (2,6,1)
    141: (4,1,2,1)    261: (6,2,1)      324: (2,4,3)
    142: (4,1,1,2)    262: (6,1,2)      325: (2,4,2,1)
    160: (2,6)        274: (4,3,2)      326: (2,4,1,2)
    162: (2,4,2)      276: (4,2,3)      327: (2,4,1,1,1)

Gus Wiseman, Statistics, classes, and transformations of standard compositions

A304712 counts the complement, with ordered version A337664.
A333228 ranks compositions whose distinct parts are pairwise coprime.
A335238 does not consider a singleton coprime unless it is (1).
A337600 counts 3-part partitions in the complement.
A000740 counts relatively prime compositions.
A051424 counts pairwise coprime or singleton partitions.
A101268 counts pairwise coprime or singleton compositions.
A327516 counts pairwise coprime partitions.
A333227 ranks pairwise coprime compositions.
A337461 counts pairwise coprime 3-part compositions.
A337561 counts pairwise coprime strict compositions.
A337665 counts compositions whose distinct parts are pairwise coprime.
A337666 ranks pairwise non-coprime compositions.
Cf. A007359, A007360, A087087, A302569, A302696, A304709, A305713, A335235, A337562, A337601, A337602, A337603.

stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
Select[Range[0,100],!(SameQ@@stc[#]||CoprimeQ@@Union[stc[#]])&]

A327406 Number of steps to reach a fixed point starting with n and repeatedly taking the quotient by the maximum divisor that is 1 or whose prime indices have a common divisor > 1 (A327405, A327656).

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 0, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2

Offset: 1

Gus Wiseman, Sep 21 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 whose prime indices have a common divisor > 1 are listed in A318978.

Note that A318978 includes also all odd primes and their powers, thus the only numbers for which a maximum such divisor is 1 are the powers of 2. Therefore A000079 gives the indices of zeros in this sequence. - Antti Karttunen, Dec 06 2021

			We have 5115 -> 165 -> 15 -> 3 -> 1, so a(5115) = 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 computed from indices in prime factorization

First appearance of n is A080696(n).
See link for additional cross-references.
Cf. A000005, A000079 (positions of 0's), A056239, A112798, A281116, A289509, A302569, A318978.

Table[Length[FixedPointList[#/Max[Select[Divisors[#],GCD@@PrimePi/@First/@FactorInteger[#]!=1&]]&,n]]-2,{n,100}]

A327405(n) = (n / vecmax(select(d -> (1==d)||(gcd(apply(primepi,factor(d)[, 1]~))>1), divisors(n))));
A327406(n) = { my(u = A327405(n), k=0); while(u!=n, k++; n = u; u = A327405(n)); (k); }; \\ Antti Karttunen, Dec 06 2021

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

A327399 Number of factorizations of n that are constant or whose distinct factors are pairwise coprime.

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

Offset: 1

Gus Wiseman, Sep 22 2019

nonn

First differs from A327400 at A327400(24) = 4, a(24) = 3.
From Jianing Song, Jun 09 2025: (Start)
Let n = (p_1)^(e_1) * ... * (p_r)^(e_r), then a(n) is the number of partitions of the multiset formed by e_1 1's, e_2 2's, ..., e_r r's such that each pair of parts is either equal or nonintersecting. Let's call such a partition a (e_1,...,e_r)-partition of {1,2,...,r}.
Note that every (e_1,...,e_r)-partition has a base partition by removing duplicates of parts and elements in each part (e.g., {{1,2,2},{1,2,2},{3,3},{4}} -> {{1,2},{3},{4}}), and the base partition is itself a partition on {1,2,...,r}. Since the number of partitions into identical parts of the multiset formed by e_{i_1} (i_1)'s, ..., e_{i_k} (i_k)'s is d(gcd(e_{i_1},...,e_{i_k})), where d = A000005, the number of (e_1,...,e_r)-partitions having base partition P of {1,2,...,r} is Product_{S in P} d(gcd_{i in S} (e_i)). As a result, the number (e_1,...,e_r)-partitions is Sum_{P is a partition of {1,2,...,r}} Product_{S in P} d(gcd_{i in S} (e_i)).
Examples:
  # of e_1-partitions = d(e_1);
  # of (e_1,e_2)-partitions = d(gcd(e_1,e_2)) + d(e_1)*d(e_2);
  # of (e_1,e_2,e_3)-partitions = d(gcd(e_1,e_2,e_3)) + d(gcd(e_1,e_2))*d(e_3) + d(gcd(e_1,e_3))*d(e_2) + d(gcd(e_2,e_3))*d(e_1) + d(e_1)*d(e_2)*d(e_3);
  # of (e_1,e_2,e_3,e_4)-partitions = d(gcd(e_1,e_2,e_3,e_4)) + (d(gcd(e_1,e_2,e_3))*d(e_4) + ...) + (d(gcd(e_1,e_2))*d(gcd(e_3,e_4)) + ...) + (d(gcd(e_1,e_2))*d(e_3)*d(e_4) + ...) + d(e_1)*d(e_2)*d(e_3)*d(e_4).
(End)

			The a(90) = 7 factorizations together with the corresponding multiset partitions of {1,2,2,3}:
  (2*3*3*5)  {{1},{2},{2},{3}}
  (2*5*9)    {{1},{3},{2,2}}
  (2*45)     {{1},{2,2,3}}
  (3*3*10)   {{2},{2},{1,3}}
  (5*18)     {{3},{1,2,2}}
  (9*10)     {{2,2},{1,3}}
  (90)       {{1,2,2,3}}

Gus Wiseman, Sequences counting and encoding certain classes of multisets

Constant factorizations are A089723.
Partitions whose distinct parts are pairwise coprime are A304709.
Factorizations that are constant or relatively prime are A327400.
See link for additional cross-references.
Cf. A007359, A050320, A051424, A281116, A302569, A302696, A304711.

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||CoprimeQ@@Union[#]&]],{n,100}]

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

A337987 Odd numbers whose distinct prime indices are pairwise coprime, where a singleton is not considered coprime unless it is (1).

Original entry on oeis.org

15, 33, 35, 45, 51, 55, 69, 75, 77, 85, 93, 95, 99, 119, 123, 135, 141, 143, 145, 153, 155, 161, 165, 175, 177, 187, 201, 205, 207, 209, 215, 217, 219, 221, 225, 245, 249, 253, 255, 265, 275, 279, 287, 291, 295, 297, 309, 323, 327, 329, 335, 341, 355, 363, 369

Offset: 1

Gus Wiseman, Oct 23 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 integer partitions with no 1's whose distinct parts are pairwise coprime (A338315). 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.

			The sequence of terms together with their prime indices begins:
     15: {2,3}      135: {2,2,2,3}    215: {3,14}
     33: {2,5}      141: {2,15}       217: {4,11}
     35: {3,4}      143: {5,6}        219: {2,21}
     45: {2,2,3}    145: {3,10}       221: {6,7}
     51: {2,7}      153: {2,2,7}      225: {2,2,3,3}
     55: {3,5}      155: {3,11}       245: {3,4,4}
     69: {2,9}      161: {4,9}        249: {2,23}
     75: {2,3,3}    165: {2,3,5}      253: {5,9}
     77: {4,5}      175: {3,3,4}      255: {2,3,7}
     85: {3,7}      177: {2,17}       265: {3,16}
     93: {2,11}     187: {5,7}        275: {3,3,5}
     95: {3,8}      201: {2,19}       279: {2,2,11}
     99: {2,2,5}    205: {3,13}       287: {4,13}
    119: {4,7}      207: {2,2,9}      291: {2,25}
    123: {2,13}     209: {5,8}        295: {3,17}

A304711 is the not necessarily odd version, with squarefree case A302797.
A337694 is a pairwise non-coprime instead of pairwise coprime version.
A337984 is the squarefree case.
A338315 counts the partitions with these Heinz numbers.
A338316 considers singletons coprime.
A007359 counts partitions into singleton or pairwise coprime parts with no 1's, with Heinz numbers A302568.
A304709 counts partitions whose distinct parts are pairwise coprime.
A327516 counts pairwise coprime partitions, with Heinz numbers A302696.
A337462 counts pairwise coprime compositions, ranked by A333227.
A337561 counts pairwise coprime strict compositions.
A337665 counts compositions whose distinct parts are pairwise coprime, ranked by A333228.
A337667 counts pairwise non-coprime compositions, ranked by A337666.
A337697 counts pairwise coprime compositions with no 1's.
A318717 counts pairwise non-coprime strict partitions, with Heinz numbers A318719.
Cf. A005408, A051424, A056239, A087087, A112798, A200976, A289508, A289509, A302569, A303282, A328867, A337485.

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

cp's OEIS Frontend

A337984 Heinz numbers of pairwise coprime integer partitions with no 1's, where a singleton is not considered coprime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A320423 Number of set partitions of {1,...,n} where each block's elements are pairwise coprime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A335237 Numbers whose binary indices are not a singleton nor pairwise coprime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A320430 Number of set partitions of [n] where the elements of each non-singleton block are pairwise coprime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A327517 Number of factorizations of n that are empty or have at least two factors, all of which are > 1 and pairwise coprime.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A327534 Numbers that are 1, prime, or whose prime indices are relatively prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A337695 Numbers k such that the distinct parts of the k-th composition in standard order (A066099) are not pairwise coprime, where a singleton is always considered coprime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A327406 Number of steps to reach a fixed point starting with n and repeatedly taking the quotient by the maximum divisor that is 1 or whose prime indices have a common divisor > 1 (A327405, A327656).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs