Square array of distinct positive integers A(n, k), n, k > 0, read and filled the greedy way by antidiagonals upwards such that the concatenations of the terms of two distinct rows are always equal.

A363931

Square array of distinct positive integers A(n, k), n, k > 0, read and filled the greedy way by antidiagonals upwards such that the concatenations of the terms of two distinct rows are always equal.

Terms

    a(0) =1a(1) =11a(2) =12a(3) =112a(4) =2a(5) =3a(6) =1123a(7) =31a(8) =311a(9) =111a(10) =11231a(11) =1111a(12) =1112a(13) =1121a(14) =121a(15) =112311a(16) =11121a(17) =21a(18) =13a(19) =32a(20) =321a(21) =1123111a(22) =11213a(23) =3211a(24) =32111a(25) =211a(26) =1113a(27) =113a(28) =11231111a(29) =1213

External references