A333227 -id:A333227 - cp's OEIS frontend

A337697 Number of pairwise coprime compositions of n with no 1's, where a singleton is not considered coprime.

0, 0, 0, 0, 0, 2, 0, 4, 2, 4, 8, 8, 14, 10, 16, 12, 30, 38, 46, 46, 48, 52, 62, 152, 96, 156, 112, 190, 256, 338, 420, 394, 326, 402, 734, 622, 1150, 802, 946, 898, 1730, 1946, 2524, 2200, 2328, 2308, 3356, 5816, 4772, 5350, 4890, 6282, 6316, 12092, 8902

Offset: 0

Gus Wiseman, Oct 06 2020

nonn

A composition of n is a finite sequence of positive integers summing to n. These compositions must be strict.

			The a(5) = 2 through a(12) = 14 compositions (empty column indicated by dot):
  (2,3)  .  (2,5)  (3,5)  (2,7)  (3,7)    (2,9)  (5,7)
  (3,2)     (3,4)  (5,3)  (4,5)  (7,3)    (3,8)  (7,5)
            (4,3)         (5,4)  (2,3,5)  (4,7)  (2,3,7)
            (5,2)         (7,2)  (2,5,3)  (5,6)  (2,7,3)
                                 (3,2,5)  (6,5)  (3,2,7)
                                 (3,5,2)  (7,4)  (3,4,5)
                                 (5,2,3)  (8,3)  (3,5,4)
                                 (5,3,2)  (9,2)  (3,7,2)
                                                 (4,3,5)
                                                 (4,5,3)
                                                 (5,3,4)
                                                 (5,4,3)
                                                 (7,2,3)
                                                 (7,3,2)

A022340 intersected with A333227 is a ranking sequence (using standard compositions A066099) for these compositions.
A212804 does not require coprimality, with unordered version A002865.
A337450 is the relatively prime instead of pairwise coprime version, with strict case A337451 and unordered version A302698.
A337462 allows 1's, with strict case A337561 (or A101268 with singletons), unordered version A327516 with Heinz numbers A302696, and 3-part case A337461.
A337485 is the unordered version (or A007359 with singletons considered coprime), with Heinz numbers A337984.
A337563 is the case of unordered triples.
Cf. A078374, A178472, A302568, A302697, A305713, A307719, A332004, A337562.

Table[Length[Join@@Permutations/@Select[IntegerPartitions[n],!MemberQ[#,1]&&CoprimeQ@@#&]],{n,0,30}]

For n > 1, the version where singletons are considered coprime is a(n) + 1.

A343655 Number of pairwise coprime sets of divisors of n, where a singleton is not considered pairwise coprime unless it is {1}.

Original entry on oeis.org

1, 2, 2, 3, 2, 6, 2, 4, 3, 6, 2, 10, 2, 6, 6, 5, 2, 10, 2, 10, 6, 6, 2, 14, 3, 6, 4, 10, 2, 22, 2, 6, 6, 6, 6, 17, 2, 6, 6, 14, 2, 22, 2, 10, 10, 6, 2, 18, 3, 10, 6, 10, 2, 14, 6, 14, 6, 6, 2, 38, 2, 6, 10, 7, 6, 22, 2, 10, 6, 22, 2, 24, 2, 6, 10, 10, 6, 22, 2

Offset: 1

Gus Wiseman, Apr 26 2021

nonn

First differs from A015995 at a(210) = 88, A015995(210) = 86.

			For example, the a(n) subsets for n = 1, 2, 4, 6, 8, 12, 16, 24 are:
  {1}  {1}    {1}    {1}      {1}    {1}      {1}     {1}
       {1,2}  {1,2}  {1,2}    {1,2}  {1,2}    {1,2}   {1,2}
              {1,4}  {1,3}    {1,4}  {1,3}    {1,4}   {1,3}
                     {1,6}    {1,8}  {1,4}    {1,8}   {1,4}
                     {2,3}           {1,6}    {1,16}  {1,6}
                     {1,2,3}         {2,3}            {1,8}
                                     {3,4}            {2,3}
                                     {1,12}           {3,4}
                                     {1,2,3}          {3,8}
                                     {1,3,4}          {1,12}
                                                      {1,24}
                                                      {1,2,3}
                                                      {1,3,4}
                                                      {1,3,8}

The case of pairs is A063647.
The case of triples is A066620.
The version with empty sets and singletons is A225520.
A version for prime indices is A304711.
The version for strict integer partitions is A305713.
The version for subsets of {1..n} is A320426 = A276187 + 1.
The version for binary indices is A326675.
The version for integer partitions is A327516.
The version for standard compositions is A333227.
The maximal case is A343652.
The case without 1's is A343653.
The case without 1's with singletons is A343654.
The maximal case without 1's is A343660.
A018892 counts coprime unordered pairs of divisors.
A051026 counts pairwise indivisible subsets of {1..n}.
A100565 counts pairwise coprime unordered triples of divisors.
A325683 counts maximal Golomb rulers.
A326077 counts maximal pairwise indivisible sets.
Cf. A007360, A062319, A067824, A076078, A084422, A187106, A282935, A285572, A304709, A320423, A337485, A343659.

Table[Length[Select[Subsets[Divisors[n]],CoprimeQ@@#&]],{n,100}]

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.

A343659 Number of maximal pairwise coprime subsets of {1..n}.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 3, 4, 7, 9, 9, 10, 10, 12, 16, 19, 19, 20, 20, 22, 28, 32, 32, 33, 54, 61, 77, 84, 84, 85, 85, 94, 112, 123, 158, 161, 161, 176, 206, 212, 212, 214, 214, 229, 241, 260, 260, 263, 417, 428, 490, 521, 521, 526, 655, 674, 764, 818, 818, 820, 820, 874, 918, 975, 1182, 1189, 1189

Offset: 1

Gus Wiseman, Apr 26 2021

nonn

For this sequence, it does not matter whether singletons are considered pairwise coprime.
For n > 2, also the number of maximal pairwise coprime subsets of {2..n}.
For each prime p <= n, p divides exactly one element of each maximal subset. - Bert Dobbelaere, May 04 2021

			The a(1) = 1 through a(9) = 7 subsets:
  {1}  {12}  {123}  {123}  {1235}  {156}   {1567}   {1567}   {1567}
                    {134}  {1345}  {1235}  {12357}  {12357}  {12357}
                                   {1345}  {13457}  {13457}  {12579}
                                                    {13578}  {13457}
                                                             {13578}
                                                             {14579}
                                                             {15789}

Bert Dobbelaere, Table of n, a(n) for n = 1..500
Bert Dobbelaere, Python program

The case of pairs is A015614.
The case of triples is A015617.
The non-maximal version counting empty sets and singletons is A084422.
The non-maximal version counting singletons is A187106.
The non-maximal version is A320426(n) = A276187(n) + 1.
The version for indivisibility instead of coprimality is A326077.
The version for sets of divisors is A343652.
The version for sets of divisors > 1 is A343660.
A018892 counts coprime unordered pairs of divisors.
A051026 counts pairwise indivisible subsets of {1..n}.
A100565 counts pairwise coprime unordered triples of divisors.
Cf. A007360, A067824, A087087, A225520, A324837, A325683, A325859, A326358, A326496, A326675, A333227, A343653, A343655.

fasmax[y_]:=Complement[y,Union@@Most@*Subsets/@y];
Table[Length[fasmax[Select[Subsets[Range[n]],CoprimeQ@@#&]]],{n,15}]

More terms from Bert Dobbelaere, May 04 2021

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[#]])&]

A333492 Position of first appearance of n in A271410 (LCM of binary indices).

Original entry on oeis.org

1, 2, 4, 8, 16, 6, 64, 128, 256, 18, 1024, 12, 4096, 66, 20, 32768, 65536, 258, 262144, 24, 68, 1026, 4194304, 132, 16777216, 4098, 67108864, 72, 268435456, 22, 1073741824, 2147483648, 1028, 65538, 80, 264, 68719476736, 262146, 4100, 144, 1099511627776, 70, 4398046511104

Offset: 1

Gus Wiseman, Mar 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 together with the corresponding binary expansions and binary indices begins:
      1:                 1 ~ {1}
      2:                10 ~ {2}
      4:               100 ~ {3}
      8:              1000 ~ {4}
     16:             10000 ~ {5}
      6:               110 ~ {2,3}
     64:           1000000 ~ {7}
    128:          10000000 ~ {8}
    256:         100000000 ~ {9}
     18:             10010 ~ {2,5}
   1024:       10000000000 ~ {11}
     12:              1100 ~ {3,4}
   4096:     1000000000000 ~ {13}
     66:           1000010 ~ {2,7}
     20:             10100 ~ {3,5}
  32768:  1000000000000000 ~ {16}
  65536: 10000000000000000 ~ {17}
    258:         100000010 ~ {2,9}

Giovanni Resta, Table of n, a(n) for n = 1..1000

The version for prime indices is A330225.
The version for standard compositions is A333225.
Let q(k) be the binary indices of k:
- The sum of q(k) is A029931(k).
- The elements of q(k) are row k of A048793.
- The product of q(k) is A096111(k).
- The LCM of q(k) is A271410(k).
- The GCD of q(k) is A326674(k).
GCD of prime indices is A289508.
LCM of prime indices is A290103.
LCM of standard compositions is A333226.
Cf. A000120, A066099, A070939, A074761, A076078, A124767, A285572, A324837, A328219, A328451, A331579, A333227.

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
q=Table[LCM@@bpe[n],{n,10000}];
Table[Position[q,i][[1,1]],{i,First[Split[Union[q],#1+1==#2&]]}]

Terms a(23) and beyond from Giovanni Resta, Mar 29 2020

A337983 Number of compositions of n into distinct parts, any two of which have a common divisor > 1.

Original entry on oeis.org

1, 0, 1, 1, 1, 1, 3, 1, 3, 3, 5, 1, 13, 1, 13, 7, 19, 1, 35, 1, 59, 15, 65, 1, 117, 5, 133, 27, 195, 1, 411, 7, 435, 67, 617, 17, 941, 7, 1177, 135, 1571, 13, 2939, 31, 3299, 375, 4757, 13, 6709, 43, 8813, 643, 11307, 61, 16427, 123, 24331, 1203, 30461, 67

Offset: 0

Gus Wiseman, Oct 06 2020

nonn

Number of pairwise non-coprime strict compositions of n.

			The a(2) = 1 through a(15) = 7 compositions (A..F = 10..15):
  2  3  4  5  6   7  8   9   A   B  C    D  E    F
              24     26  36  28     2A      2C   3C
              42     62  63  46     39      4A   5A
                             64     48      68   69
                             82     84      86   96
                                    93      A4   A5
                                    A2      C2   C3
                                    246     248
                                    264     284
                                    426     428
                                    462     482
                                    624     824
                                    642     842

A318717 is the unordered version.
A318719 is the version for Heinz numbers of partitions.
A337561 is the pairwise coprime instead of pairwise non-coprime version, or A337562 if singletons are considered coprime.
A337605*6 counts these compositions of length 3.
A337667 is the non-strict version, ranked by A337666.
A337696 ranks these compositions.
A051185 and A305843 (covering) count pairwise intersecting set-systems.
A101268 counts pairwise coprime or singleton compositions.
A200976 and A328673 are the unordered version.
A233564 ranks strict compositions.
A318749 is the version for factorizations, with non-strict version A319786.
A333228 ranks compositions whose distinct parts are pairwise coprime.
A335236 ranks compositions neither a singleton nor pairwise coprime.
A337462 counts pairwise coprime compositions.
A337694 lists numbers with no two relatively prime prime indices.
Cf. A082024, A284825, A302797, A305713, A319752, A327516, A333227, A335235, A336737, A337604.

stabQ[u_,Q_]:=And@@Not/@Q@@@Tuples[u,2];
Table[Length[Join@@Permutations/@Select[IntegerPartitions[n],UnsameQ@@#&&stabQ[#,CoprimeQ]&]],{n,0,30}]

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[#]]&]

A338315 Number of integer partitions of n with no 1's whose distinct parts are pairwise coprime, where a singleton is not considered coprime unless it is (1).

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 3, 2, 4, 4, 10, 6, 15, 13, 16, 21, 31, 29, 43, 41, 50, 63, 79, 81, 99, 113, 129, 145, 179, 197, 228, 249, 284, 328, 363, 418, 472, 522, 581, 655, 741, 828, 921, 1008, 1123, 1259, 1407, 1546, 1709, 1889, 2077, 2292, 2554, 2799, 3061, 3369

Offset: 0

Gus Wiseman, Oct 23 2020

nonn

The Heinz numbers of these partitions are given by A337987. 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 a(5) = 1 through a(13) = 15 partitions (empty column indicated by dot, A = 10, B = 11):
  32   .  43    53    54     73     65      75      76
          52    332   72     433    74      543     85
          322         522    532    83      552     94
                      3222   3322   92      732     A3
                                    443     5322    B2
                                    533     33222   544
                                    722             553
                                    3332            733
                                    5222            922
                                    32222           4333
                                                    5332
                                                    7222
                                                    33322
                                                    52222
                                                    322222

A200976 is a pairwise non-coprime instead of pairwise coprime version.
A304709 allows 1's, with strict case A305713 and Heinz numbers A304711.
A318717 counts pairwise non-coprime strict partitions.
A337485 is the strict version, with Heinz numbers A337984.
A337987 gives the Heinz numbers of these partitions.
A338317 considers singletons coprime, with Heinz numbers A338316.
A007359 counts singleton or pairwise coprime partitions with no 1's.
A327516 counts pairwise coprime partitions, ranked by A302696.
A328673 counts partitions with no two distinct parts relatively prime.
A337462 counts pairwise coprime compositions, ranked by A333227.
A337561 counts pairwise coprime strict compositions.
A337665 counts compositions whose distinct parts are pairwise coprime.
A337667 counts pairwise non-coprime compositions, ranked by A337666.
A337697 counts pairwise coprime compositions with no 1's.
Cf. A051424, A101268, A220377, A302568, A328867, A333228, A337563.

Table[Length[Select[IntegerPartitions[n],!MemberQ[#,1]&&CoprimeQ@@Union[#]&]],{n,0,30}]

A282748 Triangle read by rows: T(n,k) is the number of compositions of n into k parts x_1, x_2, ..., x_k such that gcd(x_i, x_j) = 1 for all i != j (where 1 <= k <= n).

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 4, 3, 4, 1, 1, 2, 9, 4, 5, 1, 1, 6, 3, 16, 5, 6, 1, 1, 4, 15, 4, 25, 6, 7, 1, 1, 6, 9, 28, 5, 36, 7, 8, 1, 1, 4, 21, 16, 45, 6, 49, 8, 9, 1, 1, 10, 9, 52, 25, 66, 7, 64, 9, 10, 1, 1, 4, 39, 16, 105, 36, 91, 8, 81, 10, 11, 1, 1, 12, 9, 100, 25, 186, 49, 120, 9, 100, 11, 12, 1, 1, 6, 45, 16, 205, 36, 301, 64, 153, 10, 121, 12, 13, 1

Offset: 1

N. J. A. Sloane, Mar 05 2017

See A101391 for the triangle T(n,k) = number of compositions of n into k parts x_1, x_2, ..., x_k such that gcd(x_1,x_2,...,x_k) = 1 (2 <= k <= n).

			Triangle begins:
  1;
  1,  1;
  1,  2,  1;
  1,  2,  3,   1;
  1,  4,  3,   4,   1;
  1,  2,  9,   4,   5,   1;
  1,  6,  3,  16,   5,   6,  1;
  1,  4, 15,   4,  25,   6,  7,   1;
  1,  6,  9,  28,   5,  36,  7,   8,  1;
  1,  4, 21,  16,  45,   6, 49,   8,  9,   1;
  1, 10,  9,  52,  25,  66,  7,  64,  9,  10,  1;
  1,  4, 39,  16, 105,  36, 91,   8, 81,  10, 11,  1;
  1, 12,  9, 100,  25, 186, 49, 120,  9, 100, 11, 12, 1;
  ...
From _Gus Wiseman_, Nov 12 2020: (Start)
Row n = 6 counts the following compositions:
  (6)  (15)  (114)  (1113)  (11112)  (111111)
       (51)  (123)  (1131)  (11121)
             (132)  (1311)  (11211)
             (141)  (3111)  (12111)
             (213)          (21111)
             (231)
             (312)
             (321)
             (411)
(End)

Alois P. Heinz, Rows n = 1..200, flattened (first 100 rows from Chai Wah Wu)
Temba Shonhiwa, Compositions with pairwise relatively prime summands within a restricted setting, Fibonacci Quart. 44 (2006), no. 4, 316-323.

A072704 counts the unimodal instead of coprime version.
A087087 and A335235 rank these compositions.
A101268 gives row sums.
A101391 is the relatively prime instead of pairwise coprime version.
A282749 is the unordered version.
A000740 counts relatively prime compositions, with strict case A332004.
A007360 counts pairwise coprime or singleton strict partitions.
A051424 counts pairwise coprime or singleton partitions, ranked by A302569.
A097805 counts compositions by sum and length.
A178472 counts compositions with a common divisor.
A216652 and A072574 count strict compositions by sum and length.
A305713 counts pairwise coprime strict partitions.
A327516 counts pairwise coprime partitions, ranked by A302696.
A335235 ranks pairwise coprime or singleton compositions.
A337462 counts pairwise coprime compositions, ranked by A333227.
A337562 counts pairwise coprime or singleton strict compositions.
A337665 counts compositions whose distinct parts are pairwise coprime, ranked by A333228.
Cf. A000837, A007359, A302568, A337461, A337561, A337667.

Table[Length[Select[Join@@Permutations/@IntegerPartitions[n,{k}],Length[#]==1||CoprimeQ@@#&]],{n,10},{k,n}] (* Gus Wiseman, Nov 12 2020 *)

It seems that no general formula or recurrence is known, although Shonhiwa gives formulas for a few of the early diagonals.

cp's OEIS Frontend

A337697 Number of pairwise coprime compositions of n with no 1's, where a singleton is not considered coprime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A343655 Number of pairwise coprime sets of divisors of n, where a singleton is not considered pairwise coprime unless it is {1}.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A343659 Number of maximal pairwise coprime subsets of {1..n}.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

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

A333492 Position of first appearance of n in A271410 (LCM of binary indices).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A337983 Number of compositions of n into distinct parts, any two of which have a common divisor > 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica