The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #3 Mar 31 2012 10:29:03
%S 1,1,1,1,1,2,1,1,18
%N 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.
%C 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.
%H Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/sbpnx2.txt">Solutions of small n*2 sliding block puzzles.</a>
%e 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.
%e A090034(21)=1, see link.
%Y For references, links and cross-references see A087725 and A090033.
%K hard,more,nonn,tabl
%O 1,6
%A _Hugo Pfoertner_, Nov 23 2003