OFFSET
1,3
COMMENTS
The nonincreasing run transform replaces each run of weakly decreasing terms with a single value which is the length of that run.
LINKS
Neal Gersh Tolunsky, Table of n, a(n) for n = 1..10632 (first 25 rows)
Neal Gersh Tolunsky, Ordinal transform on the first 35 iterations of the sequence
EXAMPLE
Irregular triangle in which each row (after the initial 1) is the nonincreasing run transform of the concatenation of the previous rows:
1;
1;
2;
2, 1;
2, 3;
2, 3, 1, 1;
2, 3, 1, 2, 3;
2, 3, 1, 2, 3, 1, 2, 1, 1;
2, 3, 1, 2, 3, 1, 2, 1, 2, 2, 1, 2, 3;
2, 3, 1, 2, 3, 1, 2, 1, 2, 2, 1, 2, 3, 1, 2, 1, 2, 2, 3, 1, 1;
...
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Neal Gersh Tolunsky, Sep 19 2023
STATUS
approved