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.

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.

Links

Table of n, a(n) for n=1..15.

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

Cf. A337663, A350765.

Sequence in context: A110946 A021449 A354702 * A249758 A157470 A120280

Adjacent sequences: A350761 A350762 A350763 * A350765 A350766 A350767

Keyword

nonn,tabl,more

Author

Pontus von Brömssen, Jan 14 2022

Status

approved