A337604 -id:A337604 - cp's OEIS frontend

A337694 Numbers with no two relatively prime prime indices.

1, 2, 3, 5, 7, 9, 11, 13, 17, 19, 21, 23, 25, 27, 29, 31, 37, 39, 41, 43, 47, 49, 53, 57, 59, 61, 63, 65, 67, 71, 73, 79, 81, 83, 87, 89, 91, 97, 101, 103, 107, 109, 111, 113, 115, 117, 121, 125, 127, 129, 131, 133, 137, 139, 147, 149, 151, 157, 159, 163, 167, 169, 171, 173, 179, 181, 183, 185, 189, 191, 193, 197, 199

Offset: 1

Gus Wiseman, Sep 23 2020

nonn

First differs from A305078 in having 1 and lacking 195.
First differs from A305103 in having 1 and 169 and lacking 195.
First differs from A328336 in lacking 897, with prime indices (2,6,9).
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 in which no two parts are relatively prime. The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

			The sequence of terms together with their prime indices begins:
   1: {}      37: {12}     79: {22}      121: {5,5}
   3: {2}     39: {2,6}    81: {2,2,2,2} 125: {3,3,3}
   5: {3}     41: {13}     83: {23}      127: {31}
   7: {4}     43: {14}     87: {2,10}    129: {2,14}
   9: {2,2}   47: {15}     89: {24}      131: {32}
  11: {5}     49: {4,4}    91: {4,6}     133: {4,8}
  13: {6}     53: {16}     97: {25}      137: {33}
  17: {7}     57: {2,8}   101: {26}      139: {34}
  19: {8}     59: {17}    103: {27}      147: {2,4,4}
  21: {2,4}   61: {18}    107: {28}      149: {35}
  23: {9}     63: {2,2,4} 109: {29}      151: {36}
  25: {3,3}   65: {3,6}   111: {2,12}    157: {37}
  27: {2,2,2} 67: {19}    113: {30}      159: {2,16}
  29: {10}    71: {20}    115: {3,9}     163: {38}
  31: {11}    73: {21}    117: {2,2,6}   167: {39}

Robert Israel, Table of n, a(n) for n = 1..10000

A200976 and A328673 count these partitions.
A302696 and A302569 are pairwise coprime instead of pairwise non-coprime.
A318719 is the squarefree case.
A328867 looks at distinct prime indices.
A337666 is the version for standard compositions.
A101268 counts pairwise coprime or singleton compositions.
A318717 counts strict pairwise non-coprime partitions.
A327516 counts pairwise coprime partitions.
A333227 ranks pairwise coprime compositions.
A333228 ranks compositions whose distinct parts are pairwise coprime.
A335236 ranks compositions neither a singleton nor pairwise coprime.
A337462 counts pairwise coprime compositions.
A337667 counts pairwise non-coprime compositions.
Cf. A051185, A051424, A056239, A112798, A220377, A284825, A302797, A303282, A305843, A319752, A336737, A337599, A337604, A337605.

filter:= proc(n) local F,i,j,np;
  if n::even and n>2 then return false fi;
  F:= map(t -> numtheory:-pi(t[1]), ifactors(n)[2]);
  np:= nops(F);
  for i from 1 to np-1 do
    for j from i+1 to np do
      if igcd(F[i],F[j])=1 then return false fi
  od od;
  true
end proc:
select(filter, [$1..300]); # Robert Israel, Oct 06 2020

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
stabQ[u_,Q_]:=Array[#1==#2||!Q[u[[#1]],u[[#2]]]&,{Length[u],Length[u]},1,And];
Select[Range[100],stabQ[primeMS[#],CoprimeQ]&]

A337666 Numbers k such that any two parts of the k-th composition in standard order (A066099) have a common divisor > 1.

Original entry on oeis.org

0, 2, 4, 8, 10, 16, 32, 34, 36, 40, 42, 64, 128, 130, 136, 138, 160, 162, 168, 170, 256, 260, 288, 292, 512, 514, 520, 522, 528, 544, 546, 552, 554, 640, 642, 648, 650, 672, 674, 680, 682, 1024, 2048, 2050, 2052, 2056, 2058, 2080, 2082, 2084, 2088, 2090, 2176

Offset: 1

Gus Wiseman, Oct 05 2020

nonn

Differs from A291165 in having 1090535424, corresponding to the composition (6,10,15).
This is a ranking sequence for pairwise non-coprime compositions.
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:
       0: ()          138: (4,2,2)       546: (4,4,2)
       2: (2)         160: (2,6)         552: (4,2,4)
       4: (3)         162: (2,4,2)       554: (4,2,2,2)
       8: (4)         168: (2,2,4)       640: (2,8)
      10: (2,2)       170: (2,2,2,2)     642: (2,6,2)
      16: (5)         256: (9)           648: (2,4,4)
      32: (6)         260: (6,3)         650: (2,4,2,2)
      34: (4,2)       288: (3,6)         672: (2,2,6)
      36: (3,3)       292: (3,3,3)       674: (2,2,4,2)
      40: (2,4)       512: (10)          680: (2,2,2,4)
      42: (2,2,2)     514: (8,2)         682: (2,2,2,2,2)
      64: (7)         520: (6,4)        1024: (11)
     128: (8)         522: (6,2,2)      2048: (12)
     130: (6,2)       528: (5,5)        2050: (10,2)
     136: (4,4)       544: (4,6)        2052: (9,3)

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

A337604 counts these compositions of length 3.
A337667 counts these compositions.
A337694 is the version for Heinz numbers of partitions.
A337696 is the strict case.
A051185 and A305843 (covering) count pairwise intersecting set-systems.
A101268 counts pairwise coprime or singleton compositions.
A200976 and A328673 count pairwise non-coprime partitions.
A318717 counts strict pairwise non-coprime partitions.
A327516 counts pairwise coprime partitions.
A335236 ranks compositions neither a singleton nor pairwise coprime.
A337462 counts pairwise coprime compositions.
All of the following pertain to compositions in standard order (A066099):
- A000120 is length.
- A070939 is sum.
- A124767 counts runs.
- A233564 ranks strict compositions.
- A272919 ranks constant compositions.
- A291166 appears to rank relatively prime compositions.
- A326674 is greatest common divisor.
- A333219 is Heinz number.
- A333227 ranks coprime (Mathematica definition) compositions.
- A333228 ranks compositions with distinct parts coprime.
- A335235 ranks singleton or coprime compositions.
Cf. A082024, A284825, A305713, A319752, A319786, A327039, A327040, A336737, A337599, A337605.

stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
stabQ[u_,Q_]:=And@@Not/@Q@@@Tuples[u,2];
Select[Range[0,1000],stabQ[stc[#],CoprimeQ]&]

A337484 Number of ordered triples of positive integers summing to n that are neither strictly increasing nor strictly decreasing.

Original entry on oeis.org

0, 0, 0, 1, 3, 6, 8, 13, 17, 22, 28, 35, 41, 50, 58, 67, 77, 88, 98, 111, 123, 136, 150, 165, 179, 196, 212, 229, 247, 266, 284, 305, 325, 346, 368, 391, 413, 438, 462, 487, 513, 540, 566, 595, 623, 652, 682, 713, 743, 776, 808, 841, 875, 910, 944, 981, 1017

Offset: 0

Gus Wiseman, Sep 11 2020

nonn

			The a(3) = 1 through a(7) = 13 triples:
  (1,1,1)  (1,1,2)  (1,1,3)  (1,1,4)  (1,1,5)
           (1,2,1)  (1,2,2)  (1,3,2)  (1,3,3)
           (2,1,1)  (1,3,1)  (1,4,1)  (1,4,2)
                    (2,1,2)  (2,1,3)  (1,5,1)
                    (2,2,1)  (2,2,2)  (2,1,4)
                    (3,1,1)  (2,3,1)  (2,2,3)
                             (3,1,2)  (2,3,2)
                             (4,1,1)  (2,4,1)
                                      (3,1,3)
                                      (3,2,2)
                                      (3,3,1)
                                      (4,1,2)
                                      (5,1,1)

A140106 is the unordered case.
A242771 allows strictly increasing but not strictly decreasing triples.
A337481 counts these compositions of any length.
A001399(n - 6) counts unordered strict triples.
A001523 counts unimodal compositions, with complement A115981.
A007318 and A097805 count compositions by length.
A069905 counts unordered triples.
A218004 counts strictly increasing or weakly decreasing compositions.
A332745 counts partitions with weakly increasing or weakly decreasing run-lengths.
A332835 counts compositions with weakly increasing or weakly decreasing run-lengths.
A337483 counts triples either weakly increasing or weakly decreasing.
Cf. A000212, A000217, A001840, A014311, A046691, A128422, A156040, A332834, A337461, A337482, A337561, A337603, A337604.

Table[Length[Select[Join@@Permutations/@IntegerPartitions[n,{3}],!Less@@#&&!Greater@@#&]],{n,0,15}]

a(n) = 2*A242771(n - 1) - A000217(n - 1), n > 0.
2*A001399(n - 6) = 2*A069905(n - 3) = 2*A211540(n - 1) is the complement.
4*A001399(n - 6) = 4*A069905(n - 3) = 4*A211540(n - 1) is the strict case.
Conjectures from Colin Barker, Sep 13 2020: (Start)
G.f.: x^3*(1 + 2*x + 2*x^2 - x^3) / ((1 - x)^3*(1 + x)*(1 + x + x^2)).
a(n) = a(n-1) + a(n-2) - a(n-4) - a(n-5) + a(n-6) for n>6.
(End)

A337483 Number of ordered triples of positive integers summing to n that are either weakly increasing or weakly decreasing.

Original entry on oeis.org

0, 0, 0, 1, 2, 4, 5, 8, 10, 13, 16, 20, 23, 28, 32, 37, 42, 48, 53, 60, 66, 73, 80, 88, 95, 104, 112, 121, 130, 140, 149, 160, 170, 181, 192, 204, 215, 228, 240, 253, 266, 280, 293, 308, 322, 337, 352, 368, 383, 400, 416, 433, 450, 468, 485, 504, 522, 541, 560

Offset: 0

Gus Wiseman, Sep 07 2020

			The a(3) = 1 through a(8) = 10 triples:
  (1,1,1)  (1,1,2)  (1,1,3)  (1,1,4)  (1,1,5)  (1,1,6)
           (2,1,1)  (1,2,2)  (1,2,3)  (1,2,4)  (1,2,5)
                    (2,2,1)  (2,2,2)  (1,3,3)  (1,3,4)
                    (3,1,1)  (3,2,1)  (2,2,3)  (2,2,4)
                             (4,1,1)  (3,2,2)  (2,3,3)
                                      (3,3,1)  (3,3,2)
                                      (4,2,1)  (4,2,2)
                                      (5,1,1)  (4,3,1)
                                               (5,2,1)
                                               (6,1,1)

Index entries for linear recurrences with constant coefficients, signature (1,1,0,-1,-1,1).

A001399(n - 3) = A069905(n) = A211540(n + 2) counts the unordered case.
2*A001399(n - 6) = 2*A069905(n - 3) = 2*A211540(n - 1) counts the strict case.
A001399(n - 6) = A069905(n - 3) = A211540(n - 1) counts the strict unordered case.
A329398 counts these compositions of any length.
A218004 counts strictly increasing or weakly decreasing compositions.
A337484 counts neither strictly increasing nor strictly decreasing compositions.
Cf. A000212, A000217, A001840, A014311, A156040, A337461, A337603, A337604.

Table[Length[Select[Join@@Permutations/@IntegerPartitions[n,{3}],LessEqual@@#||GreaterEqual@@#&]],{n,0,30}]

a(n > 0) = 2*A001399(n - 3) - A079978(n).
From Colin Barker, Sep 08 2020: (Start)
G.f.: x^3*(1 + x + x^2 - x^3) / ((1 - x)^3*(1 + x)*(1 + x + x^2)).
a(n) = a(n-1) + a(n-2) - a(n-4) - a(n-5) + a(n-6) for n>6. (End)
E.g.f.: (36 - 9*exp(-x) + exp(x)*(6*x^2 + 6*x - 19) - 8*exp(-x/2)*cos(sqrt(3)*x/2))/36. - Stefano Spezia, Apr 05 2023

A321773 Number of compositions of n into parts with distinct multiplicities and with exactly three parts.

Original entry on oeis.org

1, 3, 6, 4, 9, 9, 10, 12, 15, 13, 18, 18, 19, 21, 24, 22, 27, 27, 28, 30, 33, 31, 36, 36, 37, 39, 42, 40, 45, 45, 46, 48, 51, 49, 54, 54, 55, 57, 60, 58, 63, 63, 64, 66, 69, 67, 72, 72, 73, 75, 78, 76, 81, 81, 82, 84, 87, 85, 90, 90, 91, 93, 96, 94, 99, 99

Offset: 3

Alois P. Heinz, Nov 18 2018

nonn

			From _Gus Wiseman_, Nov 11 2020: (Start)
Also the number of 3-part non-strict compositions of n. For example, the a(3) = 1 through a(11) = 15 triples are:
  111   112   113   114   115   116   117   118   119
        121   122   141   133   161   144   181   155
        211   131   222   151   224   171   226   191
              212   411   223   233   225   244   227
              221         232   242   252   262   272
              311         313   323   333   334   335
                          322   332   414   343   344
                          331   422   441   424   353
                          511   611   522   433   434
                                      711   442   443
                                            622   515
                                            811   533
                                                  551
                                                  722
                                                  911
(End)

Alois P. Heinz, Table of n, a(n) for n = 3..1000

Column k=3 of A242887.
A235451 counts 3-part compositions with distinct run-lengths
A001399(n-6) counts 3-part compositions in the complement.
A014311 intersected with A335488 ranks these compositions.
A140106 is the unordered case, with Heinz numbers A285508.
A261982 counts non-strict compositions of any length.
A001523 counts unimodal compositions, with complement A115981.
A007318 and A097805 count compositions by length.
A032020 counts strict compositions.
A047967 counts non-strict partitions, with Heinz numbers A013929.
A242771 counts triples that are not strictly increasing.
Cf. A000212, A000217, A001840, A128422, A156040, A332834, A337461, A337484, A337603, A337604.

Table[Length[Join@@Permutations/@Select[IntegerPartitions[n,{3}],!UnsameQ@@#&]],{n,0,100}] (* Gus Wiseman, Nov 11 2020 *)

Conjectures from Colin Barker, Dec 11 2018: (Start)
G.f.: x^3*(1 + 3*x + 5*x^2) / ((1 - x)^2*(1 + x)*(1 + x + x^2)).
a(n) = a(n-2) + a(n-3) - a(n-5) for n>7. (End)
Conjecture: a(n) = (3*n-k)/2 where k value has a cycle of 6 starting from n=3 of (7,6,3,10,3,6). - Bill McEachen, Aug 12 2025

A242771 Number of integer points in a certain quadrilateral scaled by a factor of n (another version).

Original entry on oeis.org

0, 0, 1, 3, 6, 9, 14, 19, 25, 32, 40, 48, 58, 68, 79, 91, 104, 117, 132, 147, 163, 180, 198, 216, 236, 256, 277, 299, 322, 345, 370, 395, 421, 448, 476, 504, 534, 564, 595, 627, 660, 693, 728, 763, 799, 836, 874, 912, 952, 992, 1033, 1075, 1118, 1161, 1206

Offset: 1

Michael Somos, May 22 2014

nonn

The quadrilateral is given by four vertices [(1/2, 1/3), (0, 1), (0, 0), (1, 0)] as an example on page 22 of Ehrhart 1967. Here the open line segment from (1/2, 1/3) to (0, 1) is included but the rest of the boundary is not. The sequence is denoted by d'(n).
From Gus Wiseman, Oct 18 2020: (Start)
Also the number of ordered triples of positive integers summing to n that are not strictly increasing. For example, the a(3) = 1 through a(7) = 14 triples are:
  (1,1,1)  (1,1,2)  (1,1,3)  (1,1,4)  (1,1,5)
           (1,2,1)  (1,2,2)  (1,3,2)  (1,3,3)
           (2,1,1)  (1,3,1)  (1,4,1)  (1,4,2)
                    (2,1,2)  (2,1,3)  (1,5,1)
                    (2,2,1)  (2,2,2)  (2,1,4)
                    (3,1,1)  (2,3,1)  (2,2,3)
                             (3,1,2)  (2,3,2)
                             (3,2,1)  (2,4,1)
                             (4,1,1)  (3,1,3)
                                      (3,2,2)
                                      (3,3,1)
                                      (4,1,2)
                                      (4,2,1)
                                      (5,1,1)
A001399(n-6) counts the complement (unordered strict triples).
A014311 \ A333255 ranks these compositions.
A140106 is the unordered version.
A337484 is the case not strictly decreasing either.
A337698 counts these compositions of any length, with complement A000009.
A001399(n-6) counts unordered strict triples.
A001523 counts unimodal compositions, with complement A115981.
A007318 and A097805 count compositions by length.
A069905 counts unordered triples.
A218004 counts strictly increasing or weakly decreasing compositions.
A337483 counts triples either weakly increasing or weakly decreasing.
Cf. A332834, A337461, A337481, A337482, A337604.
(End)

			G.f. = x^3 + 3*x^4 + 6*x^5 + 9*x^6 + 14*x^7 + 19*x^8 + 25*x^9 + 32*x^10 + ...

E. Ehrhart, Sur un problème de géométrie diophantienne linéaire I, (Polyèdres et réseaux), J. Reine Angew. Math. 226 1967 1-29. MR0213320 (35 #4184).
E. Ehrhart, Sur un problème de géométrie diophantienne linéaire I, (Polyèdres et réseaux), J. Reine Angew. Math. 226 1967 1-29. MR0213320 (35 #4184). [Annotated scanned copy of pages 16 and 22 only]
E. Ehrhart, Sur un problème de géométrie diophantienne linéaire II. Systemes diophantiens lineaires, J. Reine Angew. Math. 227 1967 25-49. [Annotated scanned copy of pages 47-49 only]
Wikipedia, Ehrhart polynomial
Index entries for linear recurrences with constant coefficients, signature (1,1,0,-1,-1,1).

Cf. A002789, A010761, A147874.

Cf. A000212, A000217, A001840, A046691, A128422, A156040.

[Floor((5*n-7)*(n-1)/12): n in [1..60]]; // Vincenzo Librandi, Jun 27 2015

a[ n_] := Quotient[ 7 - 12 n + 5 n^2, 12];
a[ n_] := With[ {o = Boole[ 0 < n], c = Boole[ 0 >= n], m = Abs@n}, Length @ FindInstance[ 0 < c + x && 0 < c + y && (2 x < c + m && 4 x + 3 y < o + 3 m || m < o + 2 x && 2 x + 3 y < c + 2 m), {x, y}, Integers, 10^9]];
LinearRecurrence[{1,1,0,-1,-1,1},{0,0,1,3,6,9},90] (* Harvey P. Dale, May 28 2015 *)
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n,{3}],!Less@@#&]],{n,0,15}] (* Gus Wiseman, Oct 18 2020 *)

PARI
```
{a(n) = (7 - 12*n + 5*n^2) \ 12};
```

{a(n) = if( n<0, polcoeff( x * (2 + x^2 + x^3 + x^4) / ((1 - x)^2 * (1 - x^6)) + x * O(x^-n), -n), polcoeff( x^3 * (1 + x + x^2 + 2*x^4) / ((1 - x)^2 * (1 - x^6)) + x * O(x^n), n))};

G.f.: x^3 * (1 + 2*x + 2*x^2) / (1 - x - x^2 + x^4 + x^5 - x^6) = (x^3 + x^4 + x^5 + 2*x^7) / ((1 - x)^2 * (1 - x^6)).
a(n) = floor( A147874(n) / 12).
a(-n) = A002789(n).
a(n+1) - a(n) = A010761(n).
For n >= 6, a(n) = A000217(n-2) - A001399(n-6). - Gus Wiseman, Oct 18 2020

A337459 Numbers k such that the k-th composition in standard order is a unimodal triple.

Original entry on oeis.org

7, 11, 13, 14, 19, 21, 25, 26, 28, 35, 37, 41, 42, 49, 50, 52, 56, 67, 69, 73, 74, 81, 82, 84, 97, 98, 100, 104, 112, 131, 133, 137, 138, 145, 146, 161, 162, 164, 168, 193, 194, 196, 200, 208, 224, 259, 261, 265, 266, 273, 274, 289, 290, 292, 321, 322, 324

Offset: 1

Gus Wiseman, Sep 07 2020

nonn

A composition of n is a finite sequence of positive integers summing to n.
A sequence of integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.
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 triples begins:
      7: (1,1,1)     52: (1,2,3)    133: (5,2,1)
     11: (2,1,1)     56: (1,1,4)    137: (4,3,1)
     13: (1,2,1)     67: (5,1,1)    138: (4,2,2)
     14: (1,1,2)     69: (4,2,1)    145: (3,4,1)
     19: (3,1,1)     73: (3,3,1)    146: (3,3,2)
     21: (2,2,1)     74: (3,2,2)    161: (2,5,1)
     25: (1,3,1)     81: (2,4,1)    162: (2,4,2)
     26: (1,2,2)     82: (2,3,2)    164: (2,3,3)
     28: (1,1,3)     84: (2,2,3)    168: (2,2,4)
     35: (4,1,1)     97: (1,5,1)    193: (1,6,1)
     37: (3,2,1)     98: (1,4,2)    194: (1,5,2)
     41: (2,3,1)    100: (1,3,3)    196: (1,4,3)
     42: (2,2,2)    104: (1,2,4)    200: (1,3,4)
     49: (1,4,1)    112: (1,1,5)    208: (1,2,5)
     50: (1,3,2)    131: (6,1,1)    224: (1,1,6)

Eric Weisstein's World of Mathematics, Unimodal Sequence

A337460 is the non-unimodal version.
A000217(n - 2) counts 3-part compositions.
6*A001399(n - 6) = 6*A069905(n - 3) = 6*A211540(n - 1) counts strict 3-part compositions.
A001399(n - 3) = A069905(n) = A211540(n + 2) counts 3-part partitions.
A001399(n - 6) = A069905(n - 3) = A211540(n - 1) counts strict 3-part partitions.
A001523 counts unimodal compositions.
A007052 counts unimodal patterns.
A011782 counts unimodal permutations.
A115981 counts non-unimodal compositions.
All of the following pertain to compositions in standard order (A066099):
- Length is A000120.
- Triples are A014311, with strict case A337453.
- Sum is A070939.
- Runs are counted by A124767.
- Strict compositions are A233564.
- Constant compositions are A272919.
- Heinz number is A333219.
- Combinatory separations are counted by A334030.
- Non-unimodal compositions are A335373.
- Non-co-unimodal compositions are A335374.
Cf. A007304, A014612, A072706, A156040, A211540, A227038, A332743, A337452, A337461, A337604.

stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
Select[Range[0,1000],Length[stc[#]]==3&&!MatchQ[stc[#],{x_,y_,z_}/;x>y

Complement of A335373 in A014311.

A337460 Numbers k such that the k-th composition in standard order is a non-unimodal triple.

Original entry on oeis.org

22, 38, 44, 70, 76, 88, 134, 140, 148, 152, 176, 262, 268, 276, 280, 296, 304, 352, 518, 524, 532, 536, 552, 560, 592, 608, 704, 1030, 1036, 1044, 1048, 1064, 1072, 1096, 1104, 1120, 1184, 1216, 1408, 2054, 2060, 2068, 2072, 2088, 2096, 2120, 2128, 2144, 2192

Offset: 1

Gus Wiseman, Sep 18 2020

nonn

These are triples matching the pattern (2,1,2), (3,1,2), or (2,1,3).
A sequence of integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.
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 triples begins:
      22: (2,1,2)     296: (3,2,4)    1048: (6,1,4)
      38: (3,1,2)     304: (3,1,5)    1064: (5,2,4)
      44: (2,1,3)     352: (2,1,6)    1072: (5,1,5)
      70: (4,1,2)     518: (7,1,2)    1096: (4,3,4)
      76: (3,1,3)     524: (6,1,3)    1104: (4,2,5)
      88: (2,1,4)     532: (5,2,3)    1120: (4,1,6)
     134: (5,1,2)     536: (5,1,4)    1184: (3,2,6)
     140: (4,1,3)     552: (4,2,4)    1216: (3,1,7)
     148: (3,2,3)     560: (4,1,5)    1408: (2,1,8)
     152: (3,1,4)     592: (3,2,5)    2054: (9,1,2)
     176: (2,1,5)     608: (3,1,6)    2060: (8,1,3)
     262: (6,1,2)     704: (2,1,7)    2068: (7,2,3)
     268: (5,1,3)    1030: (8,1,2)    2072: (7,1,4)
     276: (4,2,3)    1036: (7,1,3)    2088: (6,2,4)
     280: (4,1,4)    1044: (6,2,3)    2096: (6,1,5)

Eric Weisstein's World of Mathematics, Unimodal Sequence
Gus Wiseman, Statistics, classes, and transformations of standard compositions

A000212 counts unimodal triples.
A000217(n - 2) counts 3-part compositions.
A001399(n - 3) counts 3-part partitions.
A001399(n - 6) counts 3-part strict partitions.
A001399(n - 6)*2 counts non-unimodal 3-part strict compositions.
A001399(n - 6)*4 counts unimodal 3-part strict compositions.
A001399(n - 6)*6 counts 3-part strict compositions.
A001523 counts unimodal compositions.
A001840 counts non-unimodal triples.
A059204 counts non-unimodal permutations.
A115981 counts non-unimodal compositions.
A328509 counts non-unimodal patterns.
A337459 ranks unimodal triples.
All of the following pertain to compositions in standard order (A066099):
- Length is A000120.
- Triples are A014311.
- Sum is A070939.
- Runs are counted by A124767.
- Strict compositions are A233564.
- Constant compositions are A272919.
- Heinz number is A333219.
- Non-unimodal compositions are A335373.
- Non-co-unimodal compositions are A335374.
- Strict triples are A337453.
Cf. A007304, A014612, A069905, A072706, A156040, A211540, A227038, A332743, A337461, A337604.

stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
Select[Range[0,1000],Length[stc[#]]==3&&MatchQ[stc[#],{x_,y_,z_}/;x>y

Intersection of A014311 and A335373.

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}]

A337696 Numbers k such that the k-th composition in standard order (A066099) is strict and pairwise non-coprime, meaning the parts are distinct and any two of them have a common divisor > 1.

Original entry on oeis.org

0, 2, 4, 8, 16, 32, 34, 40, 64, 128, 130, 160, 256, 260, 288, 512, 514, 520, 544, 640, 1024, 2048, 2050, 2052, 2056, 2082, 2088, 2176, 2178, 2208, 2304, 2560, 2568, 2592, 4096, 8192, 8194, 8200, 8224, 8226, 8232, 8320, 8704, 8706, 8832, 10240, 10248, 10368

Offset: 1

Gus Wiseman, Oct 06 2020

nonn

Differs from A291165 in having 1090535424, corresponding to the composition (6,10,15).

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:
       0: ()        512: (10)       2304: (3,9)
       2: (2)       514: (8,2)      2560: (2,10)
       4: (3)       520: (6,4)      2568: (2,6,4)
       8: (4)       544: (4,6)      2592: (2,4,6)
      16: (5)       640: (2,8)      4096: (13)
      32: (6)      1024: (11)       8192: (14)
      34: (4,2)    2048: (12)       8194: (12,2)
      40: (2,4)    2050: (10,2)     8200: (10,4)
      64: (7)      2052: (9,3)      8224: (8,6)
     128: (8)      2056: (8,4)      8226: (8,4,2)
     130: (6,2)    2082: (6,4,2)    8232: (8,2,4)
     160: (2,6)    2088: (6,2,4)    8320: (6,8)
     256: (9)      2176: (4,8)      8704: (4,10)
     260: (6,3)    2178: (4,6,2)    8706: (4,8,2)
     288: (3,6)    2208: (4,2,6)    8832: (4,2,8)

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

A318719 gives the Heinz numbers of the unordered version, with non-strict version A337694.
A337667 counts the non-strict version.
A337983 counts these compositions, with unordered version A318717.
A051185 counts intersecting set-systems, with spanning case A305843.
A200976 and A328673 count the unordered non-strict version.
A337462 counts pairwise coprime compositions.
A318749 counts pairwise non-coprime factorizations, with strict case A319786.
All of the following pertain to compositions in standard order (A066099):
- A000120 is length.
- A070939 is sum.
- A124767 counts runs.
- A233564 ranks strict compositions.
- A272919 ranks constant compositions.
- A333219 is Heinz number.
- A333227 ranks pairwise coprime compositions, or A335235 if singletons are considered coprime.
- A333228 ranks compositions whose distinct parts are pairwise coprime.
- A335236 ranks compositions neither a singleton nor pairwise coprime.
- A337561 is the pairwise coprime instead of pairwise non-coprime version, or A337562 if singletons are considered coprime.
- A337666 ranks the non-strict version.
Cf. A082024, A101268, A302797, A305713, A319752, A327040, A327516, A336737, A337599, A337604, A337605.

stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
stabQ[u_,Q_]:=And@@Not/@Q@@@Tuples[u,2];
Select[Range[0,1000],UnsameQ@@stc[#]&&stabQ[stc[#],CoprimeQ]&]

Intersection of A337666 and A233564.

cp's OEIS Frontend

A337694 Numbers with no two relatively prime prime indices.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A337666 Numbers k such that any two parts of the k-th composition in standard order (A066099) have a common divisor > 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A337484 Number of ordered triples of positive integers summing to n that are neither strictly increasing nor strictly decreasing.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A337483 Number of ordered triples of positive integers summing to n that are either weakly increasing or weakly decreasing.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A321773 Number of compositions of n into parts with distinct multiplicities and with exactly three parts.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A242771 Number of integer points in a certain quadrilateral scaled by a factor of n (another version).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

A337459 Numbers k such that the k-th composition in standard order is a unimodal triple.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A337460 Numbers k such that the k-th composition in standard order is a non-unimodal triple.

Views

Author

Keywords