A090167 Number of configurations of the 6 X 2 variant of the so-called "Sam Loyd" sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.

1, 2, 3, 6, 11, 20, 36, 60, 95, 155, 258, 426, 688, 1106, 1723, 2615, 3901, 5885, 8851, 13205, 19508, 28593, 41179, 58899, 83582, 118109, 165136, 228596, 312542, 423797, 568233, 755727, 994641, 1296097, 1667002, 2119476, 2660415, 3300586, 4038877

Offset: 0

Author

Hugo Pfoertner, Nov 27 2003

Keywords

• fini
• full
• nonn

Links

• Herman Jamke, Table of n, a(n) for n = 0..80 (complete sequence)
• Hugo Pfoertner, Solutions of small n*2 sliding block puzzles.
• Takaken, 11-Puzzle Page.
• Takaken, No. 62 (11 puzzles).

Crossrefs

Cf. A087725, A089473. Index of last sequence term: A090033. Other nonsquare sliding block puzzles: A090034, A090035, A090036, A090166.

Programs

Python

# alst(), moves(), swap() in A089473
alst("-123456789AB", (6, 2), v=True) # Michael S. Branicky, Dec 31 2020

Extensions

More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 22 2006