cp's OEIS Frontend

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.

A124768 Number of strictly increasing runs for compositions in standard order.

This page as a plain text file.
%I A124768 #9 Apr 09 2020 00:55:44
%S A124768 0,1,1,2,1,2,1,3,1,2,2,3,1,2,2,4,1,2,2,3,1,3,2,4,1,2,2,3,2,3,3,5,1,2,
%T A124768 2,3,2,3,2,4,1,2,3,4,2,3,3,5,1,2,2,3,1,3,2,4,2,3,3,4,3,4,4,6,1,2,2,3,
%U A124768 2,3,2,4,1,3,3,4,2,3,3,5,1,2,2,3,2,4,3,5,2,3,3,4,3,4,4,6,1,2,2,3,2,3,2,4,1
%N A124768 Number of strictly increasing runs for compositions in standard order.
%C A124768 The standard order of compositions is given by A066099.
%C A124768 A composition of n is a finite sequence of positive integers summing to n. The k-th composition in standard order (row k of 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. a(n) is the number of maximal strictly increasing runs in this composition. Alternatively, a(n) is one plus the number of weak descents in the same composition. For example, the strictly increasing runs of the 1234567th composition are ((3),(2),(1,2),(2),(1,2,5),(1),(1),(1)), so a(1234567) = 8. The 7 weak descents together with the strict ascents are: 3 >= 2 >= 1 < 2 >= 2 >= 1 < 2 < 5 >= 1 >= 1 >= 1. - _Gus Wiseman_, Apr 08 2020
%F A124768 a(0) = 0, a(n) = A124763(n) + 1 for n > 0.
%e A124768 Composition number 11 is 2,1,1; the strictly increasing runs are 2; 1; 1; so a(11) = 3.
%e A124768 The table starts:
%e A124768   0
%e A124768   1
%e A124768   1 2
%e A124768   1 2 1 3
%e A124768   1 2 2 3 1 2 2 4
%e A124768   1 2 2 3 1 3 2 4 1 2 2 3 2 3 3 5
%e A124768   1 2 2 3 2 3 2 4 1 2 3 4 2 3 3 5 1 2 2 3 1 3 2 4 2 3 3 4 3 4 4 6
%t A124768 stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
%t A124768 Table[Length[Split[stc[n],Less]],{n,0,100}] (* _Gus Wiseman_, Apr 08 2020 *)
%Y A124768 Cf. A066099, A124763, A011782 (row lengths).
%Y A124768 Compositions of n with k weak descents are A333213.
%Y A124768 All of the following pertain to compositions in standard order (A066099):
%Y A124768 - Length is A000120.
%Y A124768 - Partial sums from the right are A048793.
%Y A124768 - Sum is A070939.
%Y A124768 - Weakly decreasing compositions are A114994.
%Y A124768 - Adjacent equal pairs are counted by A124762.
%Y A124768 - Weakly decreasing runs are counted by A124765.
%Y A124768 - Weakly increasing runs are counted by A124766.
%Y A124768 - Equal runs are counted by A124767.
%Y A124768 - Strictly increasing runs are counted by A124768 (this sequence).
%Y A124768 - Strictly decreasing runs are counted by A124769.
%Y A124768 - Weakly increasing compositions are A225620.
%Y A124768 - Reverse is A228351 (triangle).
%Y A124768 - Strict compositions are A233564.
%Y A124768 - Initial intervals are A246534.
%Y A124768 - Constant compositions are A272919.
%Y A124768 - Normal compositions are A333217.
%Y A124768 - Permutations are A333218.
%Y A124768 - Heinz number is A333219.
%Y A124768 - Strictly decreasing compositions are A333255.
%Y A124768 - Strictly increasing compositions are A333256.
%Y A124768 - Anti-runs are A333489.
%Y A124768 Cf. A029931, A124760, A124761, A124764, A238343, A333220.
%K A124768 easy,nonn,tabf
%O A124768 0,4
%A A124768 _Franklin T. Adams-Watters_, Nov 06 2006