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.

1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 7

Offset

1,3

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  2  2
  4  | 2  2  2  2
  5  | 2  2  3  3  7
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):
  12  1  . 14
   . 11  4 10
   3  2  1  5
   .  1  .  6
   9  8  7 13
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):
   1 16  1  8 18
   5  3  6  1  9
  12  1 17  . 11
   2  1  4  1 13
  10  7 14  1 15

Crossrefs

Cf. A337663, A350764.

Sequence in context: A337637 A156821 A025856 * A103378 A103663 A349925

Adjacent sequences: A350762 A350763 A350764 * A350766 A350767 A350768

Keyword

nonn,tabl,more

Author

Pontus von Brömssen, Jan 14 2022

Status

approved