A349060 -id:A349060 - cp's OEIS frontend

A096441 Number of palindromic and unimodal compositions of n. Equivalently, the number of orbits under conjugation of even nilpotent n X n matrices.

1, 2, 2, 4, 3, 7, 5, 11, 8, 17, 12, 26, 18, 37, 27, 54, 38, 76, 54, 106, 76, 145, 104, 199, 142, 266, 192, 357, 256, 472, 340, 621, 448, 809, 585, 1053, 760, 1354, 982, 1740, 1260, 2218, 1610, 2818, 2048, 3559, 2590, 4485, 3264, 5616, 4097, 7018, 5120, 8728, 6378

Offset: 1

Nolan R. Wallach (nwallach(AT)ucsd.edu), Aug 10 2004

nonn

Number of partitions of n such that all differences between successive parts are even, see example. [Joerg Arndt, Dec 27 2012]
Number of partitions of n where either all parts are odd or all parts are even. - Omar E. Pol, Aug 16 2013
From Gus Wiseman, Jan 13 2022: (Start)
Also the number of integer partitions of n with all even multiplicities (or run-lengths) except possibly the first. These are the conjugates of the partitions described by Joerg Arndt above. For example, the a(1) = 1 through a(8) = 11 partitions are:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (311)    (33)      (322)      (44)
                    (211)   (11111)  (222)     (511)      (422)
                    (1111)           (411)     (31111)    (611)
                                     (2211)    (1111111)  (2222)
                                     (21111)              (3311)
                                     (111111)             (22211)
                                                          (41111)
                                                          (221111)
                                                          (2111111)
                                                          (11111111)
(End)

			From _Joerg Arndt_, Dec 27 2012: (Start)
There are a(10)=17 partitions of 10 where all differences between successive parts are even:
[ 1]  [ 1 1 1 1 1 1 1 1 1 1 ]
[ 2]  [ 2 2 2 2 2 ]
[ 3]  [ 3 1 1 1 1 1 1 1 ]
[ 4]  [ 3 3 1 1 1 1 ]
[ 5]  [ 3 3 3 1 ]
[ 6]  [ 4 2 2 2 ]
[ 7]  [ 4 4 2 ]
[ 8]  [ 5 1 1 1 1 1 ]
[ 9]  [ 5 3 1 1 ]
[10]  [ 5 5 ]
[11]  [ 6 2 2 ]
[12]  [ 6 4 ]
[13]  [ 7 1 1 1 ]
[14]  [ 7 3 ]
[15]  [ 8 2 ]
[16]  [ 9 1 ]
[17]  [ 10 ]
(End)

A. G. Elashvili and V. G. Kac, Classification of good gradings of simple Lie algebras. Lie groups and invariant theory, 85-104, Amer. Math. Soc. Transl. Ser. 2, 213, Amer. Math. Soc., Providence, RI, 2005.

Alois P. Heinz, Table of n, a(n) for n = 1..1000
Karin Baur and Nolan Wallach, Nice parabolic subalgebras of reductive Lie algebras, Represent. Theory 9 (2005), 1-29.
A. G. Elashvili and V. G. Kac, Classification of good gradings of simple Lie algebras, arXiv:math-ph/0312030, 2002-2004.
Sergi Elizalde and Emeric Deutsch, The degree of asymmetry of a sequence, Enum. Combinat. Applic. 2 (2022) no 1 #S2R7, U(0,z).

Bisections are A078408 and A096967.
The complement in partitions is counted by A006477
A version for compositions is A016116.
A pointed version is A035363, ranked by A066207.
A000041 counts integer partitions.
A025065 counts palindromic partitions.
A027187 counts partitions with even length/maximum.
A035377 counts partitions using multiples of 3.
A058696 counts partitions of even numbers, ranked by A300061.
A340785 counts factorizations into even factors.
Cf. A000009, A002865, A027383, A035457, A117298, A117989, A168021, A274230, A345170, A349060, A349061.

b:= proc(n, i) option remember; `if`(i>n, 0,
      `if`(irem(n, i)=0, 1, 0) +add(`if`(irem(j, 2)=0,
       b(n-i*j, i+1), 0), j=0..n/i))
    end:
a:= n-> b(n, 1):
seq(a(n), n=1..60);  # Alois P. Heinz, Mar 26 2014

(* The following Mathematica program first generates all of the palindromic, unimodal compositions of n and then counts them. *)
Pal[n_] := Block[{i, j, k, m, Q, L}, If[n == 1, Return[{{1}}]]; If[n == 2, Return[{{1, 1}, {2}}]]; L = {{n}}; If[Mod[n, 2] == 0, L = Append[L, {n/2, n/2}]]; For[i = 1, i < n, i++, Q = Pal[n - 2i]; m = Length[Q]; For[j = 1, j <= m, j++, If[i <= Q[[j, 1]], L = Append[L, Append[Prepend[Q[[j]], i], i]]]]]; L] NoPal[n_] := Length[Pal[n]]
a[n_] := PartitionsQ[n] + If[EvenQ[n], PartitionsP[n/2], 0]; Table[a[n], {n, 1, 55}] (* Jean-François Alcover, Mar 17 2014, after Vladeta Jovovic *)
Table[Length[Select[IntegerPartitions[n],And@@EvenQ/@Rest[Length/@Split[#]]&]],{n,1,30}] (* Gus Wiseman, Jan 13 2022 *)

my(x='x+O('x^66)); Vec(eta(x^2)/eta(x)+1/eta(x^2)-2) \\ Joerg Arndt, Jan 17 2016

G.f.: sum(j>=1, q^j * (1-q^j)/prod(i=1..j, 1-q^(2*i) ) ).
G.f.: F + G - 2, where F = Product_{j>=1} 1/(1-q^(2*j)), G = Product_{j>=0} 1/(1-q^(2*j+1)).
a(2*n) = A000041(n) + A000009(2*n); a(2*n-1) = A000009(2*n-1). - Vladeta Jovovic, Aug 11 2004
a(n) = A000009(n) + A035363(n) = A000041(n) - A006477(n). - Omar E. Pol, Aug 16 2013

A349053 Number of non-weakly alternating integer compositions of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 4, 12, 37, 95, 232, 533, 1198, 2613, 5619, 11915, 25011, 52064, 107694, 221558, 453850, 926309, 1884942, 3825968, 7749312, 15667596, 31628516, 63766109, 128415848, 258365323, 519392582, 1043405306, 2094829709, 4203577778, 8431313237, 16904555958

Offset: 0

Gus Wiseman, Dec 16 2021

nonn

We define a sequence to be weakly alternating if it is alternately weakly increasing and weakly decreasing, starting with either. Then a sequence is (strongly) alternating iff it is a weakly alternating anti-run.

			The a(6) = 12 compositions:
  (1,1,2,2,1)  (1,1,2,3)  (1,2,4)
  (1,2,1,1,2)  (1,2,3,1)  (4,2,1)
  (1,2,2,1,1)  (1,3,2,1)
  (2,1,1,2,1)  (2,1,1,3)
               (3,1,1,2)
               (3,2,1,1)

Andrew Howroyd, Table of n, a(n) for n = 0..1000 (terms 0..55 from Martin Ehrenstein)
Wikipedia, Alternating permutation

Complementary directed versions are A129852/A129853, strong A025048/A025049.
The strong version is A345192.
The complement is counted by A349052.
These compositions are ranked by A349057, strong A345168.
The complementary version for patterns is A349058, strong A345194.
The complementary multiplicative version is A349059, strong A348610.
An unordered version (partitions) is A349061, complement A349060.
The version for ordered prime factorizations is A349797, complement A349056.
The version for patterns is A350138, strong A350252.
The version for ordered factorizations is A350139.
A001250 counts alternating permutations, complement A348615.
A001700 counts compositions of 2n with alternating sum 0.
A003242 counts Carlitz (anti-run) compositions.
A011782 counts compositions, unordered A000041.
A025047 counts alternating compositions, ranked by A345167.
A106356 counts compositions by number of maximal anti-runs.
A344604 counts alternating compositions with twins.
A345164 counts alternating ordered prime factorizations.
A349054 counts strict alternating compositions.
Cf. A102726, A114901, A128761, A261983, A333213, A333755, A344614, A344615, A345165, A345170, A345195, A349799, A349800, A350251, A350252.

wwkQ[y_]:=And@@Table[If[EvenQ[m],y[[m]]<=y[[m+1]],y[[m]]>=y[[m+1]]],{m,1,Length[y]-1}]||And@@Table[If[EvenQ[m],y[[m]]>=y[[m+1]],y[[m]]<=y[[m+1]]],{m,1,Length[y]-1}];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],!wwkQ[#]&]],{n,0,10}]

a(n) = A011782(n) - A349052(n).

a(21)-a(35) from Martin Ehrenstein, Jan 08 2022

A349052 Number of weakly alternating compositions of n.

Original entry on oeis.org

1, 1, 2, 4, 8, 16, 28, 52, 91, 161, 280, 491, 850, 1483, 2573, 4469, 7757, 13472, 23378, 40586, 70438, 122267, 212210, 368336, 639296, 1109620, 1925916, 3342755, 5801880, 10070133, 17478330, 30336518, 52653939, 91389518, 158621355, 275313226, 477850887, 829388075

Offset: 0

Gus Wiseman, Nov 29 2021

nonn

We define a sequence to be weakly alternating if it is alternately weakly increasing and weakly decreasing, starting with either. A sequence is alternating iff it is a weakly alternating anti-run.

			The a(5) = 16 compositions:
  (1,1,1,1,1)  (1,1,1,2)  (1,1,3)  (1,4)  (5)
               (1,1,2,1)  (1,2,2)  (2,3)
               (1,2,1,1)  (1,3,1)  (3,2)
               (2,1,1,1)  (2,1,2)  (4,1)
                          (2,2,1)
                          (3,1,1)
The a(6) = 28 compositions:
  (111111)  (11112)  (1113)  (114)  (15)  (6)
            (11121)  (1122)  (132)  (24)
            (11211)  (1131)  (141)  (33)
            (12111)  (1212)  (213)  (42)
            (21111)  (1311)  (222)  (51)
                     (2121)  (231)
                     (2211)  (312)
                     (3111)  (411)

Andrew Howroyd, Table of n, a(n) for n = 0..1000 (Terms 0..55 from Martin Ehrenstein)

The strong case is A025047, ranked by A345167.
The directed versions are A129852 and A129853, strong A025048 and A025049.
The complement is counted by A349053, strong A345192.
The version for permutations of prime indices is A349056, strong A345164.
The complement is ranked by A349057, strong A345168.
The version for patterns is A349058, strong A345194.
The multiplicative version is A349059, strong A348610.
An unordered version (partitions) is A349060, complement A349061.
The non-alternating case is A349800, ranked by A349799.
A001250 counts alternating permutations, complement A348615.
A001700 counts compositions of 2n with alternating sum 0.
A003242 counts Carlitz (anti-run) compositions.
A011782 counts compositions.
A106356 counts compositions by number of maximal anti-runs.
A344604 counts alternating compositions with twins.
A345170 counts partitions w/ an alternating permutation, ranked by A345172.
A349054 counts strict alternating compositions.
Cf. A000041, A008965, A102726, A114901, A128761, A261983, A333213, A333755, A344614, A344615, A345165, A345195.

whkQ[y_]:=And@@Table[If[EvenQ[m],y[[m]]<=y[[m+1]],y[[m]]>=y[[m+1]]],{m,1,Length[y]-1}];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],whkQ[#]||whkQ[-#]&]],{n,0,10}]

C(n,f)={my(M=matrix(n,n,j,k,k>=j), s=M[,n]); for(b=1, n, f=!f; M=matrix(n,n,j,k, if(k1,M[j-k,k-1]) ))); for(k=2, n, M[,k]+=M[,k-1]); s+=M[,n]); s~}
seq(n) = concat([1], C(n,0) + C(n,1) - vector(n,j,numdiv(j))) \\ Andrew Howroyd, Jan 31 2024

a(21)-a(37) from Martin Ehrenstein, Jan 08 2022

A349057 Numbers k such that the k-th composition in standard order is not weakly alternating.

Original entry on oeis.org

37, 46, 52, 53, 69, 75, 78, 92, 93, 101, 104, 105, 107, 110, 116, 117, 133, 137, 139, 142, 150, 151, 156, 157, 165, 174, 180, 181, 184, 185, 186, 187, 190, 197, 200, 201, 203, 206, 208, 209, 210, 211, 214, 215, 220, 221, 229, 232, 233, 235, 238, 244, 245, 261

Offset: 1

Gus Wiseman, Dec 04 2021

nonn

We define a sequence to be weakly alternating if it is alternately weakly increasing and weakly decreasing, starting with either.

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 terms and corresponding compositions begin:
   37: (3,2,1)
   46: (2,1,1,2)
   52: (1,2,3)
   53: (1,2,2,1)
   69: (4,2,1)
   75: (3,2,1,1)
   78: (3,1,1,2)
   92: (2,1,1,3)
   93: (2,1,1,2,1)
  101: (1,3,2,1)
  104: (1,2,4)
  105: (1,2,3,1)
  107: (1,2,2,1,1)
  110: (1,2,1,1,2)
  116: (1,1,2,3)
  117: (1,1,2,2,1)

The strong case is A345168, complement A345167, counted by A345192.
The strong anti-run case is A345169, counted by A345195.
Including all non-anti-runs gives A348612, complement A333489.
These compositions are counted by A349053, complement A349052.
The directed cases are counted by A129852 (incr.) and A129853 (decr.).
The complement for patterns is A349058, strong A345194.
The complement for ordered factorizations is A349059, strong A348610.
Partitions of this type are counted by A349061, complement A349060.
Partitions of this type are ranked by A349794.
Non-strict partitions of this type are counted by A349796.
Permutations of prime indices of this type are counted by A349797.
A001250 counts alternating permutations, complement A348615.
A003242 counts Carlitz (anti-run) compositions, complement A261983.
A011782 counts compositions.
A025047 counts alternating/wiggly compositions, directed A025048, A025049.
A345164 counts alternating permutations of prime indices, weak A349056.
A345165 counts partitions w/o an alternating permutation, ranked by A345171.
A345170 counts partitions w/ an alternating permutation, ranked by A345172.
A349054 counts strict alternating compositions.
Cf. A001700, A096441, A128761, A344615, A344654, A345173, A348613, A349051, A349794, A349795, A349799.

stc[n_]:=Differences[Prepend[Join@@Position[ Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
whkQ[y_]:=And@@Table[If[EvenQ[m], y[[m]]<=y[[m+1]],y[[m]]>=y[[m+1]]],{m,1,Length[y]-1}];
Select[Range[0,100],!whkQ[stc[#]]&&!whkQ[-stc[#]]&]

A349061 Number of integer partitions of n with at least one part of odd multiplicity that is not the first or last.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 2, 4, 8, 13, 21, 32, 48, 67, 99, 133, 185, 245, 333, 432, 574, 732, 957, 1208, 1554, 1941, 2468, 3060, 3844, 4731, 5893, 7204, 8898, 10816, 13268, 16043, 19546, 23523, 28497, 34150, 41147, 49106, 58892, 70020, 83597, 99047, 117778, 139087

Offset: 0

Gus Wiseman, Dec 06 2021

nonn

Also the number of non-weakly alternating integer partitions of n, where we define a sequence to be weakly alternating if it is alternately weakly increasing and weakly decreasing, starting with either. This sequence looks at the somewhat degenerate case where no strict increases are allowed.

			The a(6) = 1 through a(10) = 13 partitions:
  (321)  (421)   (431)    (432)     (532)
         (3211)  (521)    (531)     (541)
                 (4211)   (621)     (631)
                 (32111)  (3321)    (721)
                          (4311)    (4321)
                          (5211)    (5311)
                          (42111)   (6211)
                          (321111)  (32221)
                                    (33211)
                                    (43111)
                                    (52111)
                                    (421111)
                                    (3211111)

The strong version for compositions is A345192, ranked by A345168.
The version for compositions is A349053, ranked by A349057.
The complement is counted by A349060.
These partitions are ranked by A349794.
The non-strict case is A349796, complement A349795.
The strong case is A349801.
A000041 counts integer partitions.
A001250 counts alternating permutations, complement A348615.
A003242 counts Carlitz (anti-run) compositions.
A025047 counts alternating compositions, ranked by A345167.
A025048 and A025049 count directed alternating compositions.
A096441 counts weakly alternating 0-appended partitions.
A345170 counts partitions w/ an alternating permutation, ranked by A345172.
A349052 counts weakly alternating compositions.
A349056 counts weakly alternating permutations of prime indices.
A349798 counts weakly but not strongly alternating perms of prime indices.
Cf. A002865, A027383, A117298, A117989, A129852, A129853, A274230, A333213, A344615, A345165, A349059.

Table[Length[Select[IntegerPartitions[n], !SameQ@@#&&!And@@EvenQ/@Take[Length/@Split[#],{2,-2}]&]],{n,0,30}]

A349056 Number of weakly alternating permutations of the multiset of prime factors of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 2, 1, 1, 3, 1, 3, 2, 2, 1, 4, 1, 2, 1, 3, 1, 4, 1, 1, 2, 2, 2, 4, 1, 2, 2, 4, 1, 4, 1, 3, 3, 2, 1, 5, 1, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 6, 1, 2, 3, 1, 2, 4, 1, 3, 2, 4, 1, 6, 1, 2, 3, 3, 2, 4, 1, 5, 1, 2, 1, 6, 2, 2, 2

Offset: 1

Gus Wiseman, Dec 02 2021

nonn

We define a sequence to be weakly alternating if it is alternately weakly increasing and weakly decreasing, starting with either. Then a sequence is alternating in the sense of A025047 iff it is a weakly alternating anti-run.

A prime index of n is a number m such that prime(m) divides n. For n > 1, the multiset of prime factors of n is row n of A027746. The prime indices A112798 can also be used.

			The following are the weakly alternating permutations for selected n:
n = 2   6    12    24     48      60     90     120     180
   ----------------------------------------------------------
    2   23   223   2223   22223   2253   2335   22253   22335
        32   232   2232   22232   2325   2533   22325   22533
             322   2322   22322   2523   3253   22523   23253
                   3222   23222   3252   3325   23252   23352
                          32222   3522   3352   25232   25233
                                  5232   3523   32225   25332
                                         5233   32522   32325
                                         5332   35222   32523
                                                52223   33252
                                                52322   33522
                                                        35232
                                                        52323
                                                        53322

Counting all permutations of prime factors gives A008480.
The variation counting anti-run permutations is A335452.
The strong case is A345164, with twins A344606.
Compositions of this type are counted by A349052, also A129852 and A129853.
Compositions not of this type are counted by A349053, ranked by A349057.
The version for patterns is A349058, strong A345194.
The version for ordered factorizations is A349059, strong A348610.
Partitions of this type are counted by A349060, complement A349061.
The complement is counted by A349797.
The non-alternating case is A349798.
A001250 counts alternating permutations, complement A348615.
A003242 counts Carlitz (anti-run) compositions.
A025047 counts alternating or wiggly compositions, ranked by A345167.
A056239 adds up prime indices, row sums of A112798, row lengths A001222.
A071321 gives the alternating sum of prime factors, reverse A071322.
A344616 gives the alternating sum of prime indices, reverse A316524.
A345165 counts partitions w/o an alternating permutation, ranked by A345171.
A345170 counts partitions w/ an alternating permutation, ranked by A345172.
A348379 counts factorizations with an alternating permutation.
A349800 counts weakly but not strongly alternating compositions.
Cf. A028234, A051119, A096441, A335433, A335448, A344614, A344652, A344653, A345173, A345192.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
whkQ[y_]:=And@@Table[If[EvenQ[m],y[[m]]<=y[[m+1]],y[[m]]>=y[[m+1]]],{m,1,Length[y]-1}];
Table[Length[Select[Permutations[primeMS[n]],whkQ[#]||whkQ[-#]&]],{n,100}]

A349059 Number of weakly alternating ordered factorizations of n.

Original entry on oeis.org

1, 1, 1, 2, 1, 3, 1, 4, 2, 3, 1, 8, 1, 3, 3, 8, 1, 8, 1, 8, 3, 3, 1, 18, 2, 3, 4, 8, 1, 11, 1, 16, 3, 3, 3, 22, 1, 3, 3, 18, 1, 11, 1, 8, 8, 3, 1, 38, 2, 8, 3, 8, 1, 18, 3, 18, 3, 3, 1, 32, 1, 3, 8, 28, 3, 11, 1, 8, 3, 11, 1, 56, 1, 3, 8, 8, 3, 11, 1, 38, 8, 3

Offset: 1

Gus Wiseman, Dec 04 2021

nonn

An ordered factorization of n is a finite sequence of positive integers > 1 with product n.

We define a sequence to be weakly alternating if it is alternately weakly increasing and weakly decreasing, starting with either.

			The ordered factorizations for n = 2, 4, 6, 8, 12, 24, 30:
  (2)  (4)    (6)    (8)      (12)     (24)       (30)
       (2*2)  (2*3)  (2*4)    (2*6)    (3*8)      (5*6)
              (3*2)  (4*2)    (3*4)    (4*6)      (6*5)
                     (2*2*2)  (4*3)    (6*4)      (10*3)
                              (6*2)    (8*3)      (15*2)
                              (2*2*3)  (12*2)     (2*15)
                              (2*3*2)  (2*12)     (3*10)
                              (3*2*2)  (2*2*6)    (2*5*3)
                                       (2*4*3)    (3*2*5)
                                       (2*6*2)    (3*5*2)
                                       (3*2*4)    (5*2*3)
                                       (3*4*2)
                                       (4*2*3)
                                       (6*2*2)
                                       (2*2*2*3)
                                       (2*2*3*2)
                                       (2*3*2*2)
                                       (3*2*2*2)

The strong version for compositions is A025047, also A025048, A025049.
The strong case is A348610, complement A348613.
The version for compositions is A349052, complement A349053.
As compositions these are ranked by the complement of A349057.
A001055 counts factorizations, strict A045778, ordered A074206.
A001250 counts alternating permutations, complement A348615.
A335434 counts separable factorizations, complement A333487.
A345164 counts alternating permutations of prime factors, w/ twins A344606.
A345170 counts partitions with an alternating permutation.
A348379 = factorizations w/ alternating permutation, complement A348380.
A348611 counts anti-run ordered factorizations, complement A348616.
A349060 counts weakly alternating partitions, complement A349061.
A349800 = weakly but not strongly alternating compositions, ranked A349799.
Cf. A003242, A122181, A138364, A339846, A339890, A345165, A345167, A345194, A347050, A347438, A347463, A347706.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&, Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
whkQ[y_]:=And@@Table[If[EvenQ[m],y[[m]]<=y[[m+1]],y[[m]]>=y[[m+1]]], {m,1,Length[y]-1}];
Table[Length[Select[Join@@Permutations/@facs[n], whkQ[#]||whkQ[-#]&]],{n,100}]

a(2^n) = A349052(n).

A349054 Number of alternating strict compositions of n. Number of alternating (up/down or down/up) permutations of strict integer partitions of n.

Original entry on oeis.org

1, 1, 1, 3, 3, 5, 9, 11, 15, 21, 35, 41, 59, 75, 103, 155, 193, 255, 339, 443, 569, 841, 1019, 1365, 1743, 2295, 2879, 3785, 5151, 6417, 8301, 10625, 13567, 17229, 21937, 27509, 37145, 45425, 58345, 73071, 93409, 115797, 147391, 182151, 229553, 297061, 365625

Offset: 0

Gus Wiseman, Dec 21 2021

nonn

A strict composition of n is a finite sequence of distinct positive integers summing to n.
A sequence is alternating if it is alternately strictly increasing and strictly decreasing, starting with either.
The case starting with an increase (or decrease, it doesn't matter in the enumeration) is counted by A129838.

			The a(1) = 1 through a(7) = 11 compositions:
  (1)  (2)  (3)    (4)    (5)    (6)      (7)
            (1,2)  (1,3)  (1,4)  (1,5)    (1,6)
            (2,1)  (3,1)  (2,3)  (2,4)    (2,5)
                          (3,2)  (4,2)    (3,4)
                          (4,1)  (5,1)    (4,3)
                                 (1,3,2)  (5,2)
                                 (2,1,3)  (6,1)
                                 (2,3,1)  (1,4,2)
                                 (3,1,2)  (2,1,4)
                                          (2,4,1)
                                          (4,1,2)

Wikipedia, Alternating permutation

Ranking sequences are put in parentheses below.
This is the strict case of A025047/A025048/A025049 (A345167).
This is the alternating case of A032020 (A233564).
The unordered case (partitions) is A065033.
The directed case is A129838.
A001250 = alternating permutations (A349051), complement A348615 (A350250).
A003242 = Carlitz (anti-run) compositions, complement A261983.
A011782 = compositions, unordered A000041.
A345165 = partitions without an alternating permutation (A345171).
A345170 = partitions with an alternating permutation (A345172).
A345192 = non-alternating compositions (A345168).
A345195 = non-alternating anti-run compositions (A345169).
A349800 = weakly but not strongly alternating compositions (A349799).
A349052 = weakly alternating compositions, complement A349053 (A349057).
Cf. A000111, A008965, A015723, A114901, A128761, A129852, A129853, A218074, A333213, A344614, A345164, A345194, A349060, A349795.

g:= proc(u, o) option remember;
      `if`(u+o=0, 1, add(g(o-1+j, u-j), j=1..u))
    end:
b:= proc(n, k) option remember; `if`(k<0 or n<0, 0,
      `if`(k=0, `if`(n=0, 2, 0), b(n-k, k)+b(n-k, k-1)))
    end:
a:= n-> add(b(n, k)*g(k, 0), k=0..floor((sqrt(8*n+1)-1)/2))-1:
seq(a(n), n=0..46);  # Alois P. Heinz, Dec 22 2021

wigQ[y_]:=Or[Length[y]==0,Length[Split[y]]==Length[y]&&Length[Split[Sign[Differences[y]]]]==Length[y]-1];
Table[Length[Select[Join@@Permutations/@Select[IntegerPartitions[n],UnsameQ@@#&],wigQ]],{n,0,15}]

a(n) = 2 * A129838(n) - 1.

G.f.: Sum_{n>0} A001250(n)*x^(n*(n+1)/2)/Product_{k=1..n}(1-x^k).

A349058 Number of weakly alternating patterns of length n.

Original entry on oeis.org

1, 1, 3, 11, 43, 203, 1123, 7235, 53171, 439595, 4037371, 40787579, 449500595, 5366500163, 68997666867, 950475759899, 13966170378907, 218043973366091, 3604426485899203, 62894287709616755, 1155219405655975763, 22279674547003283003, 450151092568978825707

Offset: 0

Gus Wiseman, Dec 04 2021

nonn

We define a pattern to be a finite sequence covering an initial interval of positive integers. Patterns are counted by A000670 and ranked by A333217.

We define a sequence to be weakly alternating if it is alternately weakly increasing and weakly decreasing, starting with either.

			The a(1) = 1 through a(3) = 11 patterns:
  (1)  (1,1)  (1,1,1)
       (1,2)  (1,1,2)
       (2,1)  (1,2,1)
              (1,2,2)
              (1,3,2)
              (2,1,1)
              (2,1,2)
              (2,1,3)
              (2,2,1)
              (2,3,1)
              (3,1,2)

Andrew Howroyd, Table of n, a(n) for n = 0..200

The strict case is A001250, complement A348615.
The strong case of compositions is A025047, ranked by A345167.
The unordered version is A052955.
The strong case is A345194, with twins A344605. Also the directed case.
The version for compositions is A349052, complement A349053.
The version for permutations of prime indices: A349056, complement A349797.
The version for compositions is ranked by A349057.
The version for ordered factorizations is A349059, strong A348610.
The version for partitions is A349060, complement A349061.
A003242 counts Carlitz (anti-run) compositions.
A005649 counts anti-run patterns.
A344604 counts alternating compositions with twins.
A345163 counts normal partitions with an alternating permutation.
A345170 counts partitions w/ an alternating permutation, complement A345165.
A345192 counts non-alternating compositions, ranked by A345168.
A349055 counts multisets w/ an alternating permutation, complement A349050.
Cf. A049774, A096441, A129852, A129853, A336103, A344614, A344615, A344740, A345164, A348613, A349794.

allnorm[n_]:=If[n<=0,{{}},Function[s,Array[Count[s, y_/;y<=#]+1&,n]]/@Subsets[Range[n-1]+1]];
whkQ[y_]:=And@@Table[If[EvenQ[m],y[[m]]<=y[[m+1]],y[[m]]>=y[[m+1]]],{m,1,Length[y]-1}];
Table[Length[Select[Join@@Permutations/@allnorm[n],whkQ[#]||whkQ[-#]&]],{n,0,6}]

R(n,k)={my(v=vector(k,i,1), u=vector(n)); for(r=1, n, if(r%2==0, my(s=v[k]); forstep(i=k, 2, -1, v[i] = s - v[i-1]); v[1] = s); for(i=2, k, v[i] += v[i-1]); u[r]=v[k]); u}
seq(n)= {concat([1], -vector(n,i,1) + 2*sum(k=1, n, R(n, k)*sum(r=k, n, binomial(r, k)*(-1)^(r-k)) ) )} \\ Andrew Howroyd, Jan 13 2024

a(9)-a(18) from Alois P. Heinz, Dec 10 2021

a(19) onwards from Andrew Howroyd, Jan 13 2024

A349800 Number of integer compositions of n that are weakly alternating and have at least two adjacent equal parts.

Original entry on oeis.org

0, 0, 1, 1, 4, 9, 16, 33, 62, 113, 205, 373, 664, 1190, 2113, 3744, 6618, 11683, 20564, 36164, 63489, 111343, 195042, 341357, 596892, 1042976, 1821179, 3178145, 5543173, 9663545, 16839321, 29332231, 51075576, 88908912, 154722756, 269186074, 468221264

Offset: 0

Gus Wiseman, Dec 16 2021

nonn

We define a sequence to be weakly alternating if it is alternately weakly increasing and weakly decreasing, starting with either.

This sequence counts compositions that are weakly but not strongly alternating; also weakly alternating non-anti-run compositions.

			The a(2) = 1 through a(6) = 16 compositions:
  (1,1)  (1,1,1)  (2,2)      (1,1,3)      (3,3)
                  (1,1,2)    (1,2,2)      (1,1,4)
                  (2,1,1)    (2,2,1)      (2,2,2)
                  (1,1,1,1)  (3,1,1)      (4,1,1)
                             (1,1,1,2)    (1,1,1,3)
                             (1,1,2,1)    (1,1,2,2)
                             (1,2,1,1)    (1,1,3,1)
                             (2,1,1,1)    (1,3,1,1)
                             (1,1,1,1,1)  (2,2,1,1)
                                          (3,1,1,1)
                                          (1,1,1,1,2)
                                          (1,1,1,2,1)
                                          (1,1,2,1,1)
                                          (1,2,1,1,1)
                                          (2,1,1,1,1)
                                          (1,1,1,1,1,1)

Andrew Howroyd, Table of n, a(n) for n = 0..1000
Wikipedia, Alternating permutation

This is the weakly alternating case of A345192, ranked by A345168.
The case of partitions is A349795, ranked by A350137.
The version counting permutations of prime indices is A349798.
These compositions are ranked by A349799.
A001250 = alternating permutations, ranked by A349051, complement A348615.
A003242 = Carlitz (anti-run) compositions, ranked by A333489.
A025047/A025048/A025049 = alternating compositions, ranked by A345167.
A261983 = non-anti-run compositions, ranked by A348612.
A345165 = partitions without an alternating permutation, ranked by A345171.
A345170 = partitions with an alternating permutation, ranked by A345172.
A345173 = non-alternating anti-run partitions, ranked by A345166.
A345195 = non-alternating anti-run compositions, ranked by A345169.
A348377 = non-alternating non-twin compositions.
A349801 = non-alternating partitions, ranked by A289553.
Weakly alternating:
- A349052 = compositions, directed A129852/A129853, complement A349053.
- A349056 = permutations of prime indices, complement A349797.
- A349057 = complement of standard composition numbers (too dense).
- A349058 = patterns, complement A350138.
- A349059 = ordered factorizations, complement A350139.
- A349060 = partitions, complement A349061.
Cf. A008965, A011782, A027383, A096441, A274230, A333213, A344614, A344615, A348382, A348613, A349796, A350140.

wigQ[y_]:=Or[Length[y]==0,Length[Split[y]]==Length[y] &&Length[Split[Sign[Differences[y]]]]==Length[y]-1];
whkQ[y_]:=And@@Table[If[EvenQ[m],y[[m]]<=y[[m+1]],y[[m]]>=y[[m+1]]],{m,1,Length[y]-1}];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],(whkQ[#]||whkQ[-#])&&!wigQ[#]&]],{n,0,10}]

a(n) = A349052(n) - A025047(n). - Andrew Howroyd, Jan 31 2024

a(21) onwards from Andrew Howroyd, Jan 31 2024

cp's OEIS Frontend

A096441 Number of palindromic and unimodal compositions of n. Equivalently, the number of orbits under conjugation of even nilpotent n X n matrices.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A349053 Number of non-weakly alternating integer compositions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A349052 Number of weakly alternating compositions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A349057 Numbers k such that the k-th composition in standard order is not weakly alternating.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A349061 Number of integer partitions of n with at least one part of odd multiplicity that is not the first or last.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A349056 Number of weakly alternating permutations of the multiset of prime factors of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A349059 Number of weakly alternating ordered factorizations of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A349054 Number of alternating strict compositions of n. Number of alternating (up/down or down/up) permutations of strict integer partitions of n.

Views

Author

Keywords