login
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
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.
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
KEYWORD
nonn,tabl
AUTHOR
Rémy Sigrist, Dec 17 2023
STATUS
approved