Smallest number (>1) which appears at least n times in Losanitsch's triangle

[Alonso Del Arte]

We all know A062527, Smallest number (>1) which appears at least n
times in Pascal's triangle.

I looked for the Losanitsch's triangle equivalent of that sequence in
the OEIS. A little observation quickly shows that any integer m > 1
will occur at least four times, in the second outermost diagonals. It
looks like this sequence begins 2, 4, 6, 110, with offset 4.

Has anyone else pondered this sequence?

Alonso