A368060 Triangle T(n, k), n > 0, k = 1..n, read and filled in the greedy way by rows such that T(n, k) corresponds to the size of the connected component of terms equal to T(n, k) including the position (n, k).

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

Offset

1,2

Comments

This sequence is a variant of A368148.

Empirically, each column is eventually periodic.

Links

Table of n, a(n) for n=1..91.

Rémy Sigrist, Illustration of initial rows

Rémy Sigrist, Representation of first 500 rows

Rémy Sigrist, PARI program

Example

Triangle T(n, k) begins:
              1
             2 2
            1 3 1
           2 2 3 2
          1 3 1 3 2
         2 2 3 2 1 3
        1 3 1 3 2 3 1
       2 2 3 2 1 3 2 2
      1 3 1 3 2 4 1 3 1
     2 2 3 2 1 3 4 2 3 2

Prog

(PARI) See Links section.

Crossrefs

Cf. A368148.

Sequence in context: A135352 A320040 A072528 * A227083 A327571 A166363

Adjacent sequences: A368057 A368058 A368059 * A368061 A368062 A368063

Keyword

nonn,tabl

Author

Rémy Sigrist, Dec 17 2023

Status

approved