A332287 -id:A332287 - cp's OEIS frontend

A332728 Number of integer partitions of n whose negated first differences (assuming the last part is zero) are unimodal.

1, 1, 2, 3, 4, 5, 7, 8, 10, 13, 14, 17, 22, 24, 28, 34, 37, 43, 53, 56, 64, 76, 83, 93, 111, 117, 131, 153, 163, 182, 210, 225, 250, 284, 304, 332, 377, 401, 441, 497, 529, 576, 647, 687, 745, 830, 883, 955, 1062, 1127, 1216, 1339, 1422, 1532, 1684, 1779, 1914

Offset: 0

Gus Wiseman, Feb 26 2020

nonn

First differs from A000041 at a(6) = 10, A000041(6) = 11.

A sequence of positive integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

			The a(1) = 1 through a(8) = 10 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (43)       (44)
             (111)  (31)    (41)     (42)      (52)       (53)
                    (1111)  (221)    (51)      (61)       (62)
                            (11111)  (222)     (331)      (71)
                                     (321)     (421)      (332)
                                     (111111)  (2221)     (431)
                                               (1111111)  (521)
                                                          (2222)
                                                          (11111111)

Fausto A. C. Cariboni, Table of n, a(n) for n = 0..600
Eric Weisstein's World of Mathematics, Unimodal Sequence.
Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

The non-negated version is A332283.
The non-negated complement is counted by A332284.
The strict case is A332577.
The case of run-lengths (instead of differences) is A332638.
The complement is counted by A332744.
The Heinz numbers of partitions not in this class are A332287.
Unimodal compositions are A001523.
Compositions whose negation is unimodal are A332578.
Compositions whose run-lengths are unimodal are A332726.
Cf. A007052, A332280, A332285, A332286, A332639, A332642, A332669, A332670, A332741.

unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
Table[Length[Select[IntegerPartitions[n],unimodQ[-Differences[Append[#,0]]]&]],{n,0,30}]

A332743 Number of non-unimodal compositions of n covering an initial interval of positive integers.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 5, 14, 35, 83, 193, 417, 890, 1847, 3809, 7805, 15833, 32028, 64513, 129671, 260155, 521775, 1044982, 2092692, 4188168, 8381434, 16767650, 33544423, 67098683, 134213022, 268443023, 536912014, 1073846768, 2147720476, 4295440133, 8590833907

Offset: 0

Gus Wiseman, Mar 02 2020

nonn

A sequence of integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

A composition of n is a finite sequence of positive integers summing to n.

			The a(5) = 1 through a(7) = 14 compositions:
  (212)  (213)   (1213)
         (312)   (1312)
         (1212)  (2113)
         (2112)  (2122)
         (2121)  (2131)
                 (2212)
                 (3112)
                 (3121)
                 (11212)
                 (12112)
                 (12121)
                 (21112)
                 (21121)
                 (21211)

MathWorld, Unimodal Sequence

Not requiring non-unimodality gives A107429.
Not requiring the covering condition gives A115981.
The complement is counted by A227038.
A version for partitions is A332579, with complement A332577.
Unimodal compositions are A001523.
Non-unimodal permutations are A059204.
Non-unimodal normal sequences are A328509.
Numbers whose unsorted prime signature is not unimodal are A332282.
Cf. A007052, A072704, A072706, A332281, A332284, A332287, A332578, A332639, A332642, A332669, A332834, A332870.

normQ[m_]:=m=={}||Union[m]==Range[Max[m]];
unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],normQ[#]&&!unimodQ[#]&]],{n,0,10}]

For n > 0, a(n) = A107429(n) - A227038(n).

A332672 Number of non-unimodal permutations of a multiset whose multiplicities are the prime indices of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 2, 3, 0, 0, 6, 0, 0, 6, 16, 0, 21, 0, 12, 10, 0, 0, 48, 16, 0, 81, 20, 0, 48, 0, 104, 15, 0, 30, 162, 0, 0, 21, 104, 0, 90, 0, 30, 198, 0, 0, 336, 65, 124, 28, 42, 0, 603, 50, 190, 36, 0, 0, 396, 0, 0, 405, 688, 77, 150, 0, 56, 45, 260, 0

Offset: 1

Gus Wiseman, Feb 23 2020

nonn

This multiset is generally not the same as the multiset of prime indices of n. For example, the prime indices of 12 are {1,1,2}, while a multiset whose multiplicities are {1,1,2} is {1,1,2,3}.

A sequence of integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

			The a(n) permutations for n = 8, 9, 12, 15, 16:
  213   1212   1213   11212   1324
  312   2112   1312   12112   1423
        2121   2113   12121   2134
               2131   21112   2143
               3112   21121   2314
               3121   21211   2413
                              3124
                              3142
                              3214
                              3241
                              3412
                              4123
                              4132
                              4213
                              4231
                              4312

MathWorld, Unimodal Sequence

Positions of zeros are one and A001751.
Support is A264828 without one.
Dominated by A318762.
The complement is counted by A332294.
A less interesting version is A332671.
The opposite version is A332742.
Unimodal compositions are A001523.
Non-unimodal permutations are A059204.
Non-unimodal compositions are A115981.
Non-unimodal normal sequences are A328509.
Heinz numbers of partitions with non-unimodal run-lengths are A332282.
Compositions whose negation is not unimodal are A332669.
Cf. A007052, A008480, A056239, A112798, A124010, A181819, A181821, A332281, A332287, A332294, A332642, A332741.

nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
Table[Length[Select[Permutations[nrmptn[n]],!unimodQ[#]&]],{n,30}]

a(n) = A332671(A181821(n)).

a(n) + A332294(n) = A318762(n).

A332744 Number of integer partitions of n whose negated first differences (assuming the last part is zero) are not unimodal.

Original entry on oeis.org

0, 0, 0, 0, 1, 2, 4, 7, 12, 17, 28, 39, 55, 77, 107, 142, 194, 254, 332, 434, 563, 716, 919, 1162, 1464, 1841, 2305, 2857, 3555, 4383, 5394, 6617, 8099, 9859, 12006, 14551, 17600, 21236, 25574, 30688, 36809, 44007, 52527, 62574, 74430, 88304, 104675, 123799

Offset: 0

Gus Wiseman, Feb 27 2020

nonn

A sequence of positive integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

			The a(4) = 1 through a(9) = 17 partitions:
  (211)  (311)   (411)    (322)     (422)      (522)
         (2111)  (2211)   (511)     (611)      (711)
                 (3111)   (3211)    (3221)     (3222)
                 (21111)  (4111)    (3311)     (4221)
                          (22111)   (4211)     (4311)
                          (31111)   (5111)     (5211)
                          (211111)  (22211)    (6111)
                                    (32111)    (32211)
                                    (41111)    (33111)
                                    (221111)   (42111)
                                    (311111)   (51111)
                                    (2111111)  (222111)
                                               (321111)
                                               (411111)
                                               (2211111)
                                               (3111111)
                                               (21111111)
For example, the partition y = (4,2,1,1,1) has negated 0-appended first differences (2,1,0,0,1), which is not unimodal, so y is counted under a(9).

Fausto A. C. Cariboni, Table of n, a(n) for n = 0..600
Eric Weisstein's World of Mathematics, Unimodal Sequence.
Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

The complement is counted by A332728.
The non-negated version is A332284.
The strict case is A332579.
The case of run-lengths (instead of differences) is A332639.
The Heinz numbers of these partitions are A332832.
Unimodal compositions are A001523.
Non-unimodal compositions are A115981.
Heinz numbers of partitions with non-unimodal run-lengths are A332282.
Partitions whose 0-appended first differences are unimodal are A332283.
Compositions whose negation is unimodal are A332578.
Numbers whose negated prime signature is not unimodal are A332642.
Compositions whose negation is not unimodal are A332669.
Cf. A059204, A227038, A332280, A332285, A332286, A332287, A332638, A332670, A332725, A332726.

unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
Table[Length[Select[IntegerPartitions[n],!unimodQ[-Differences[Append[#,0]]]&]],{n,0,30}]

A332832 Heinz numbers of integer partitions whose negated first differences (assuming the last part is zero) are not unimodal.

Original entry on oeis.org

12, 20, 24, 28, 36, 40, 44, 45, 48, 52, 56, 60, 63, 68, 72, 76, 80, 84, 88, 90, 92, 96, 99, 100, 104, 108, 112, 116, 117, 120, 124, 126, 132, 135, 136, 140, 144, 148, 152, 153, 156, 160, 164, 165, 168, 171, 172, 175, 176, 180, 184, 188, 189, 192, 195, 196, 198

Offset: 1

Gus Wiseman, Mar 02 2020

nonn

First differs from A065201 in having 165.
First differs from A316597 in having 36.
A sequence of integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.
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:
   12: {1,1,2}
   20: {1,1,3}
   24: {1,1,1,2}
   28: {1,1,4}
   36: {1,1,2,2}
   40: {1,1,1,3}
   44: {1,1,5}
   45: {2,2,3}
   48: {1,1,1,1,2}
   52: {1,1,6}
   56: {1,1,1,4}
   60: {1,1,2,3}
   63: {2,2,4}
   68: {1,1,7}
   72: {1,1,1,2,2}
   76: {1,1,8}
   80: {1,1,1,1,3}
   84: {1,1,2,4}
   88: {1,1,1,5}
   90: {1,2,2,3}
For example, 60 is the Heinz number of (3,2,1,1), with negated 0-appended first-differences (1,1,0,1), which are not unimodal, so 60 is in the sequence.

MathWorld, Unimodal Sequence
Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

The non-negated version is A332287.
The version for of run-lengths (instead of differences) is A332642.
The enumeration of these partitions by sum is A332744.
Unimodal compositions are A001523.
Non-unimodal compositions are A115981.
Heinz numbers of partitions with non-unimodal run-lengths are A332282.
Partitions whose 0-appended first differences are unimodal are A332283.
Compositions whose negation is unimodal are A332578.
Compositions whose negation is not unimodal are A332669.
Cf. A059204, A227038, A332284, A332285, A332286, A332578, A332638, A332639, A332670, A332725, A332728.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
Select[Range[100],!unimodQ[Differences[Prepend[primeMS[#],0]]]&]

A335374 Numbers k such that the k-th composition in standard order (A066099) is not co-unimodal.

Original entry on oeis.org

13, 25, 27, 29, 41, 45, 49, 50, 51, 53, 54, 55, 57, 59, 61, 77, 81, 82, 83, 89, 91, 93, 97, 98, 99, 101, 102, 103, 105, 107, 108, 109, 110, 111, 113, 114, 115, 117, 118, 119, 121, 123, 125, 141, 145, 153, 155, 157, 161, 162, 163, 165, 166, 167, 169, 173, 177

Offset: 1

Gus Wiseman, Jun 03 2020

nonn

A sequence of integers is co-unimodal if it is the concatenation of a weakly decreasing and a weakly increasing sequence, implying that its negation is unimodal.

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:
  13: (1,2,1)
  25: (1,3,1)
  27: (1,2,1,1)
  29: (1,1,2,1)
  41: (2,3,1)
  45: (2,1,2,1)
  49: (1,4,1)
  50: (1,3,2)
  51: (1,3,1,1)
  53: (1,2,2,1)
  54: (1,2,1,2)
  55: (1,2,1,1,1)
  57: (1,1,3,1)
  59: (1,1,2,1,1)
  61: (1,1,1,2,1)
  77: (3,1,2,1)
  81: (2,4,1)
  82: (2,3,2)
  83: (2,3,1,1)
  89: (2,1,3,1)

This is the dual version of A335373.
The case that is not unimodal either is A335375.
Unimodal compositions are A001523.
Unimodal normal sequences are A007052.
Unimodal permutations are A011782.
Non-unimodal permutations are A059204.
Non-unimodal compositions are A115981.
Non-unimodal normal sequences are A328509.
Numbers with non-unimodal unsorted prime signature are A332282.
Co-unimodal compositions are A332578.
Numbers with non-co-unimodal unsorted prime signature are A332642.
Non-co-unimodal compositions are A332669.
Cf. A000120, A029931, A048793, A066099, A070939, A334299.
Cf. A112798, A227038, A329398, A332281, A332286, A332287, A332638, A332639, A332643, A332670, A332873, A333146.

unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
Select[Range[0,100],!unimodQ[-stc[#]]&]

A335375 Numbers k such that the k-th composition in standard order (A066099) is neither unimodal nor co-unimodal.

Original entry on oeis.org

45, 54, 77, 89, 91, 93, 102, 108, 109, 110, 118, 141, 153, 155, 157, 166, 173, 177, 178, 179, 181, 182, 183, 185, 187, 189, 198, 204, 205, 206, 214, 216, 217, 218, 219, 220, 221, 222, 230, 236, 237, 238, 246, 269, 281, 283, 285, 297, 301, 305, 306, 307, 309

Offset: 1

Gus Wiseman, Jun 04 2020

nonn

A sequence of integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence. It is co-unimodal if its negation is unimodal.

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:
   45: (2,1,2,1)
   54: (1,2,1,2)
   77: (3,1,2,1)
   89: (2,1,3,1)
   91: (2,1,2,1,1)
   93: (2,1,1,2,1)
  102: (1,3,1,2)
  108: (1,2,1,3)
  109: (1,2,1,2,1)
  110: (1,2,1,1,2)
  118: (1,1,2,1,2)
  141: (4,1,2,1)
  153: (3,1,3,1)
  155: (3,1,2,1,1)
  157: (3,1,1,2,1)
  166: (2,3,1,2)
  173: (2,2,1,2,1)
  177: (2,1,4,1)
  178: (2,1,3,2)
  179: (2,1,3,1,1)

Non-unimodal compositions are ranked by A335373.
Non-co-unimodal compositions are ranked by A335374.
Unimodal compositions are A001523.
Unimodal normal sequences are A007052.
Unimodal permutations are A011782.
Non-unimodal permutations are A059204.
Non-unimodal compositions are A115981.
Non-unimodal normal sequences are A328509.
Numbers with non-unimodal unsorted prime signature are A332282.
Co-unimodal compositions are A332578.
Numbers with non-co-unimodal unsorted prime signature are A332642.
Non-co-unimodal compositions are A332669.
Cf. A000120, A029931, A048793, A066099, A070939, A334299.
Cf. A112798, A227038, A329398, A332281, A332286, A332287, A332638, A332639, A332643, A332670, A332873, A333146.

unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
Select[Range[0,100],!unimodQ[stc[#]]&&!unimodQ[-stc[#]]&]

cp's OEIS Frontend

A332728 Number of integer partitions of n whose negated first differences (assuming the last part is zero) are unimodal.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A332743 Number of non-unimodal compositions of n covering an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A332672 Number of non-unimodal permutations of a multiset whose multiplicities are the prime indices of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A332744 Number of integer partitions of n whose negated first differences (assuming the last part is zero) are not unimodal.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A332832 Heinz numbers of integer partitions whose negated first differences (assuming the last part is zero) are not unimodal.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A335374 Numbers k such that the k-th composition in standard order (A066099) is not co-unimodal.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A335375 Numbers k such that the k-th composition in standard order (A066099) is neither unimodal nor co-unimodal.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica