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

[Jud McCranie]

At 05:06 PM 3/10/2006, Alonso Del Arte wrote:
>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.

a(8)=a(9)=a(10)=110 also.