This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A349799 #11 Dec 18 2021 14:56:30 %S A349799 3,7,10,11,14,15,19,21,23,26,27,28,29,30,31,35,36,39,42,43,47,51,55, %T A349799 56,57,58,59,60,61,62,63,67,71,73,74,79,83,84,85,86,87,90,91,94,95,99, %U A349799 100,103,106,111,112,113,114,115,118,119,120,121,122,123,124,125 %N A349799 Numbers k such that the k-th composition in standard order is weakly alternating but has at least two adjacent equal parts. %C A349799 We define a sequence to be weakly alternating if it is alternately weakly increasing and weakly decreasing, starting with either. %C A349799 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. %C A349799 This sequence ranks compositions that are weakly but not strongly alternating. %H A349799 Wikipedia, <a href="https://en.wikipedia.org/wiki/Alternating_permutation">Alternating permutation</a> %F A349799 Equals A345168 \ A349057 = A348612 \ A349057. %e A349799 The terms and corresponding compositions begin: %e A349799 3: (1,1) %e A349799 7: (1,1,1) %e A349799 10: (2,2) %e A349799 11: (2,1,1) %e A349799 14: (1,1,2) %e A349799 15: (1,1,1,1) %e A349799 19: (3,1,1) %e A349799 21: (2,2,1) %e A349799 23: (2,1,1,1) %e A349799 26: (1,2,2) %e A349799 27: (1,2,1,1) %e A349799 28: (1,1,3) %e A349799 29: (1,1,2,1) %e A349799 30: (1,1,1,2) %e A349799 31: (1,1,1,1,1) %t A349799 stc[n_]:=Differences[Prepend[Join@@Position[ Reverse[IntegerDigits[n,2]],1],0]]//Reverse; %t A349799 whkQ[y_]:=And@@Table[If[EvenQ[m],y[[m]]<=y[[m+1]],y[[m]]>=y[[m+1]]],{m,1,Length[y]-1}]; %t A349799 Select[Range[0,100],(whkQ[stc[#]]||whkQ[-stc[#]])&&MatchQ[stc[#],{___,x_,x_,___}]&] %Y A349799 Partitions of this type are counted by A349795, ranked by A350137. %Y A349799 Permutations of prime indices of this type are counted by A349798. %Y A349799 These compositions are counted by A349800. %Y A349799 A001250 = alternating permutations, ranked by A349051, complement A348615. %Y A349799 A003242 = Carlitz (anti-run) compositions, ranked by A333489. %Y A349799 A025047/A025048/A025049 = alternating compositions, ranked by A345167. %Y A349799 A261983 = non-anti-run compositions, ranked by A348612. %Y A349799 A345164 = alternating permutations of prime indices, with twins A344606. %Y A349799 A345165 = partitions without an alternating permutation, ranked by A345171. %Y A349799 A345170 = partitions with an alternating permutation, ranked by A345172. %Y A349799 A345166 = separable partitions with no alternations, ranked by A345173. %Y A349799 A345192 = non-alternating compositions, ranked by A345168. %Y A349799 A345195 = non-alternating anti-run compositions, ranked by A345169. %Y A349799 A349052/A129852/A129853 = weakly alternating compositions. %Y A349799 A349053 = non-weakly alternating compositions, ranked by A349057. %Y A349799 A349056 = weak alternations of prime indices, complement A349797. %Y A349799 A349060 = weak alternations of partitions, complement A349061. %Y A349799 Cf. A005649, A049774, A096441, A128761, A344615, A345163, A349054, A349058, A349796, A349801, A350140. %K A349799 nonn %O A349799 1,1 %A A349799 _Gus Wiseman_, Dec 15 2021