This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A350765 #5 Jan 27 2022 21:01:05 %S A350765 1,1,2,2,2,2,2,2,2,2,2,2,3,3,7 %N A350765 Triangle read by rows: T(n,k) is the minimum number of 1's required to reach the maximum possible number A350764(n,k), when the stepping stone puzzle of A337663 is played on the n X k grid, 1 <= k <= n. %e A350765 Triangle begins: %e A350765 n\k| 1 2 3 4 5 %e A350765 ---+-------------- %e A350765 1 | 1 %e A350765 2 | 1 2 %e A350765 3 | 2 2 2 %e A350765 4 | 2 2 2 2 %e A350765 5 | 2 2 3 3 7 %e A350765 At least T(5,4) = 3 1's are required to reach the number A350764(5,4) = 14 on the 5 X 4 grid (it is also possible with 4, 5, or 6 1's): %e A350765 12 1 . 14 %e A350765 . 11 4 10 %e A350765 3 2 1 5 %e A350765 . 1 . 6 %e A350765 9 8 7 13 %e A350765 T(5,5) = 7 1's are required to reach the number A350764(5,5) = 18 on the 5 X 5 grid (no other number of 1's is possible): %e A350765 1 16 1 8 18 %e A350765 5 3 6 1 9 %e A350765 12 1 17 . 11 %e A350765 2 1 4 1 13 %e A350765 10 7 14 1 15 %Y A350765 Cf. A337663, A350764. %K A350765 nonn,tabl,more %O A350765 1,3 %A A350765 _Pontus von Brömssen_, Jan 14 2022