|
%I #26 Dec 19 2023 09:18:01
%S 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,
%T 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,
%U 3,2,1,3,2,2,4,1,4,1,1,3,1,3,2,4,1,3,1,2,2,4,2
%N 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).
%C This sequence is a variant of A368148.
%C Empirically, each column is eventually periodic.
%H Rémy Sigrist, <a href="/A368060/a368060.png">Illustration of initial rows</a>
%H Rémy Sigrist, <a href="/A368060/a368060_1.png">Representation of first 500 rows</a>
%H Rémy Sigrist, <a href="/A368060/a368060.gp.txt">PARI program</a>
%e Triangle T(n, k) begins:
%e 1
%e 2 2
%e 1 3 1
%e 2 2 3 2
%e 1 3 1 3 2
%e 2 2 3 2 1 3
%e 1 3 1 3 2 3 1
%e 2 2 3 2 1 3 2 2
%e 1 3 1 3 2 4 1 3 1
%e 2 2 3 2 1 3 4 2 3 2
%o (PARI) See Links section.
%Y Cf. A368148.
%K nonn,tabl
%O 1,2
%A _Rémy Sigrist_, Dec 17 2023
|
