login
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.
3
1, 1, 2, 2, 4, 7, 2, 6, 9, 11, 2, 6, 11, 14, 18
OFFSET
1,3
COMMENTS
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.
EXAMPLE
Triangle begins:
n\k| 1 2 3 4 5
---+--------------
1 | 1
2 | 1 2
3 | 2 4 7
4 | 2 6 9 11
5 | 2 6 11 14 18
For n = k = 4, T(4,4) = 11 can be reached by starting with 2, 3, 4, or 5 1's:
9 1 10 . 1 11 1 9 1 11 1 8 1 11 1 6
6 2 7 . 7 . 2 6 9 . . 7 8 . 1 4
. 3 1 . 5 1 3 . 6 2 1 5 5 2 1 1
11 8 4 5 10 4 8 . 3 1 4 10 10 3 7 9
CROSSREFS
Sequence in context: A110946 A021449 A354702 * A249758 A157470 A120280
KEYWORD
nonn,tabl,more
AUTHOR
STATUS
approved