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
Examples
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
Links
- Rémy Sigrist, Illustration of initial rows
- Rémy Sigrist, Representation of first 500 rows
- Rémy Sigrist, PARI program
Crossrefs
Cf. A368148.
Programs
-
PARI
See Links section.
Comments