A365838 a(1)=2; thereafter extend the sequence by appending its nondecreasing run transform, recompute the nondecreasing run transform, append it, and so on.

2, 1, 1, 1, 1, 3, 1, 5, 1, 5, 2, 1, 5, 2, 2, 1, 1, 5, 2, 2, 1, 2, 2, 1, 1, 5, 2, 2, 1, 2, 2, 3, 2, 3, 1, 1, 5, 2, 2, 1, 2, 2, 3, 2, 3, 3, 2, 4, 2, 1, 1, 5, 2, 2, 1, 2, 2, 3, 2, 3, 3, 2, 4, 2, 3, 2, 4, 3, 2, 1, 1, 1, 5, 2, 2, 1, 2, 2, 3, 2, 3, 3, 2, 4, 2, 3, 2, 4, 3, 2, 1, 3, 2, 4, 3, 2, 2, 2, 1, 1

Offset

1,1

Comments

The nondecreasing run transform replaces each run of weakly increasing terms with a single value which is the length of that run.

Links

Neal Gersh Tolunsky, Table of n, a(n) for n = 1..9294 (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 2) is the nondecreasing run transform of the concatenation of the previous rows:
  2;
  1;
  1, 1;
  1, 3;
  1, 5;
  1, 5, 2;
  1, 5, 2, 2, 1;
  1, 5, 2, 2, 1, 2, 2, 1;
  1, 5, 2, 2, 1, 2, 2, 3, 2, 3, 1;
  1, 5, 2, 2, 1, 2, 2, 3, 2, 3, 3, 2, 4, 2, 1;
  ...

Crossrefs

Cf. A365836, A306211.

Sequence in context: A237983 A335977 A334055 * A254613 A129265 A030358

Adjacent sequences: A365835 A365836 A365837 * A365839 A365840 A365841

Keyword

nonn,tabf

Author

Neal Gersh Tolunsky, Sep 20 2023

Status

approved