|
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
|
| |
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
T(k,j)=T(j,k). Extension: a(10)=T(4,4)>=13, a(11)=T(5,1)=1, a(12)=T(5,2)=2.
|
|
LINKS
|
Hugo Pfoertner, Solutions of small n*2 sliding block puzzles.
|
|
EXAMPLE
|
a(5)=T(3,2)=1 because the 3*2 sliding block puzzle has only one configuration requiring the maximum solution path length A090033(5)=21.
A090034(21)=1, see link.
|
|
CROSSREFS
|
For references, links and cross-references see A087725 and A090033.
Sequence in context: A095836 A156697 A154991 this_sequence A124001 A157453 A156889
Adjacent sequences: A090160 A090161 A090162 this_sequence A090164 A090165 A090166
|
|
KEYWORD
|
hard,more,nonn,tabl
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 23 2003
|
|
|
Search completed in 0.002 seconds
|
