|
Search: id:A090163
|
|
|
| A090163 |
|
Triangle T(j,k) read by rows, where T(j,K)=number of different configurations having the largest required number of moves S(j,k)=A090033(n) in optimal solutions of the j X k generalization of Sam Loyd's sliding block 15-puzzle, starting with the empty square in a corner. |
|
+0
3
|
| |
|
|
Search completed in 0.002 seconds
|
