Triangle T(j,k) read by rows, where T(j,k) is the number of single tile moves in the longest optimal solution of the j X k generalization of the sliding block 15-puzzle, starting with the empty square in a corner.
A090033
Triangle T(j,k) read by rows, where T(j,k) is the number of single tile moves in the longest optimal solution of the j X k generalization of the sliding block 15-puzzle, starting with the empty square in a corner.
Terms
- a(0) =0a(1) =1a(2) =6a(3) =2a(4) =21a(5) =31a(6) =3a(7) =36a(8) =53a(9) =80a(10) =4a(11) =55a(12) =84
External references
- oeis: A090033