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.

A354905 First position of n in A354578, where A354578(k) is the number of integer compositions whose run-sums constitute the k-th composition in standard order (graded reverse-lexicographic, A066099).

Original entry on oeis.org

3, 0, 2, 8, 32, 68, 130, 290, 274, 580, 520, 1298, 2080, 1096, 2082, 4168, 2178, 4164, 4386, 35137, 8328, 8786, 10274, 8772, 16712, 20562, 8712, 16658, 33320, 41554, 33288, 82210, 34856, 66628, 33312, 66642, 34850, 69704, 140306, 133448, 69714, 74308, 133154
Offset: 0

Views

Author

Gus Wiseman, Jun 21 2022

Keywords

Comments

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.
Every sequence can be uniquely split into a sequence of non-overlapping runs. For example, the runs of (2,2,1,1,1,3,2,2) are ((2,2),(1,1,1),(3),(2,2)), with sums (4,3,3,4).

Examples

			The terms and their corresponding compositions begin:
     3: (1,1)
     0: ()
     2: (2)
     8: (4)
    32: (6)
    68: (4,3)
   130: (6,2)
   290: (3,4,2)
   274: (4,3,2)
   580: (3,4,3)
   520: (6,4)
  1298: (2,4,3,2)
The inverse run-sum compositions for n = 2, 8, 32, 68, 130, 290:
  (2)   (4)     (6)       (43)     (62)       (342)
  (11)  (22)    (33)      (223)    (332)      (3411)
        (1111)  (222)     (4111)   (611)      (11142)
                (111111)  (11113)  (3311)     (32211)
                          (22111)  (22211)    (111411)
                                   (1111112)  (311112)
                                              (1112211)
		

Crossrefs

The standard compositions used here are A066099, run-sums A353847/A353932.
This is the position of the first appearance of n in A354578.
A011782 counts compositions.
A003242 counts anti-run compositions, ranked by A333489.
A005811 counts runs in binary expansion.
A353838 ranks partitions with all distinct run-sums, counted by A353837.
A353851 counts compositions with all equal run-sums, ranked by A353848.
A353852 ranks compositions with all distinct run-sums, counted by A353850.
A353853-A353859 pertain to composition run-sum trajectory.
A354904 lists positions of zeros in A354578, complement A354912.
A354908 ranks collapsible compositions, counted by A353860.

Programs

  • Mathematica
    nn=1000;
    stc[n_]:=Differences[Prepend[Join@@ Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
    antirunQ[y_]:=Length[Split[y]]==Length[y];
    q=Table[Length[Select[Tuples[Divisors/@stc[n]],antirunQ]],{n,0,nn}];
    w=Last[Select[Table[Take[q+1,i],{i,nn}],Union[#]==Range[Max@@#]&]-1];
    Table[Position[w,k][[1,1]]-1,{k,0,Max@@w}]