A090032 Number of configurations of the 6 X 6 variant of Sam Loyd's sliding block 15-puzzle ("35-puzzle") that require a minimum of n moves to be reached, starting with the empty square in one of the corners.

1, 2, 4, 10, 26, 66, 171, 440, 1112, 2786, 6820, 16720, 41106, 100856, 245793, 597030, 1441292, 3469486, 8304526, 19832076, 47110238, 111669014

Offset

0,2

References

See A087725.

Links

Table of n, a(n) for n=0..21.

Hugo Pfoertner, Configuration counts for n*n sliding block puzzles.

Prog

See link in A089473.
(Python) # uses alst(), swap() in A089473
start, shape = "-123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ", (6, 6)
print(alst(start, shape, maxd=16)) # Michael S. Branicky, Jan 02 2021

Crossrefs

Cf. A087725, A089473, A089484, A090031.

Sequence in context: A239076 A217988 A295704 * A090377 A151278 A307756

Adjacent sequences: A090029 A090030 A090031 * A090033 A090034 A090035

Keyword

fini,hard,more,nonn

Author

Hugo Pfoertner, Nov 25 2003

Extensions

a(17)-a(21) from Michael S. Branicky, Dec 28 2020

Status

approved