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 A350764 #6 Jan 27 2022 21:00:53 %S A350764 1,1,2,2,4,7,2,6,9,11,2,6,11,14,18 %N A350764 Triangle read by rows: T(n,k) is the maximum number that can be reached following the rules of the stepping stone puzzle of A337663 restricted to the n X k grid, allowing any number of initial 1's, 1 <= k <= n. %C A350764 The possible numbers of initial 1's required to reach T(n,k) are not always consecutive. For n = 5 and k = 2, 2 or 4 initial 1's are required to reach T(5,2) = 6. %e A350764 Triangle begins: %e A350764 n\k| 1 2 3 4 5 %e A350764 ---+-------------- %e A350764 1 | 1 %e A350764 2 | 1 2 %e A350764 3 | 2 4 7 %e A350764 4 | 2 6 9 11 %e A350764 5 | 2 6 11 14 18 %e A350764 For n = k = 4, T(4,4) = 11 can be reached by starting with 2, 3, 4, or 5 1's: %e A350764 9 1 10 . 1 11 1 9 1 11 1 8 1 11 1 6 %e A350764 6 2 7 . 7 . 2 6 9 . . 7 8 . 1 4 %e A350764 . 3 1 . 5 1 3 . 6 2 1 5 5 2 1 1 %e A350764 11 8 4 5 10 4 8 . 3 1 4 10 10 3 7 9 %Y A350764 Cf. A337663, A350765. %K A350764 nonn,tabl,more %O A350764 1,3 %A A350764 _Pontus von Brömssen_, Jan 14 2022