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 A345911 #12 Jul 10 2021 03:04:57 %S A345911 1,6,7,20,21,26,27,30,31,72,73,82,83,86,87,92,93,100,101,106,107,110, %T A345911 111,116,117,122,123,126,127,272,273,290,291,294,295,300,301,312,313, %U A345911 324,325,330,331,334,335,340,341,346,347,350,351,360,361,370,371,374 %N A345911 Numbers k such that the k-th composition in standard order (row k of A066099) has reverse-alternating sum 1. %C A345911 The reverse-alternating sum of a sequence (y_1,...,y_k) is Sum_i (-1)^(k-i) y_i. %C A345911 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. %e A345911 The sequence of terms together with the corresponding compositions begins: %e A345911 1: (1) %e A345911 6: (1,2) %e A345911 7: (1,1,1) %e A345911 20: (2,3) %e A345911 21: (2,2,1) %e A345911 26: (1,2,2) %e A345911 27: (1,2,1,1) %e A345911 30: (1,1,1,2) %e A345911 31: (1,1,1,1,1) %e A345911 72: (3,4) %e A345911 73: (3,3,1) %e A345911 82: (2,3,2) %e A345911 83: (2,3,1,1) %e A345911 86: (2,2,1,2) %e A345911 87: (2,2,1,1,1) %t A345911 stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse; %t A345911 sats[y_]:=Sum[(-1)^(i-Length[y])*y[[i]],{i,Length[y]}]; %t A345911 Select[Range[0,100],sats[stc[#]]==1&] %Y A345911 These compositions are counted by A000984 (bisection of A126869). %Y A345911 The version for Heinz numbers of partitions is A001105. %Y A345911 A version using runs of binary digits is A066879. %Y A345911 These are positions of 1's in A344618. %Y A345911 The non-reverse version is A345909. %Y A345911 The opposite (negative 1) version is A345912. %Y A345911 The version for prime indices is A345958. %Y A345911 Standard compositions: A000120, A066099, A070939, A228351, A124754, A344618. %Y A345911 A000041 counts partitions of 2n with alternating sum 0, ranked by A000290. %Y A345911 A011782 counts compositions. %Y A345911 A097805 counts compositions by alternating or reverse-alternating sum. %Y A345911 A103919 counts partitions by sum and alternating sum (reverse: A344612). %Y A345911 A316524 gives the alternating sum of prime indices (reverse: A344616). %Y A345911 A344610 counts partitions by sum and positive reverse-alternating sum. %Y A345911 A344611 counts partitions of 2n with reverse-alternating sum >= 0. %Y A345911 A345197 counts compositions by sum, length, and alternating sum. %Y A345911 Compositions of n, 2n, or 2n+1 with alternating/reverse-alternating sum k: %Y A345911 - k = 0: counted by A088218, ranked by A344619/A344619. %Y A345911 - k = 1: counted by A000984, ranked by A345909/A345911. %Y A345911 - k = -1: counted by A001791, ranked by A345910/A345912. %Y A345911 - k = 2: counted by A088218, ranked by A345925/A345922. %Y A345911 - k = -2: counted by A002054, ranked by A345924/A345923. %Y A345911 - k >= 0: counted by A116406, ranked by A345913/A345914. %Y A345911 - k <= 0: counted by A058622(n-1), ranked by A345915/A345916. %Y A345911 - k > 0: counted by A027306, ranked by A345917/A345918. %Y A345911 - k < 0: counted by A294175, ranked by A345919/A345920. %Y A345911 - k != 0: counted by A058622, ranked by A345921/A345921. %Y A345911 - k even: counted by A081294, ranked by A053754/A053754. %Y A345911 - k odd: counted by A000302, ranked by A053738/A053738. %Y A345911 Cf. A000070, A000097, A000346, A008549, A025047, A027193, A031448, A034871, A114121, A120452, A344607. %K A345911 nonn %O A345911 1,2 %A A345911 _Gus Wiseman_, Jul 01 2021