login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 3

%I #8 Jan 02 2021 14:57:06

%S 1,2,4,10,26,66,171,440,1112,2786,6820,16720,41106,100856,245793,

%T 597030,1441292,3469486,8304526,19832076,47110238,111669014

%N 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.

%D See A087725.

%H Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/sbpnxn.txt">Configuration counts for n*n sliding block puzzles.</a>

%o See link in A089473.

%o (Python) # uses alst(), swap() in A089473

%o start, shape = "-123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ", (6, 6)

%o print(alst(start, shape, maxd=16)) # _Michael S. Branicky_, Jan 02 2021

%Y Cf. A087725, A089473, A089484, A090031.

%K fini,hard,more,nonn

%O 0,2

%A _Hugo Pfoertner_, Nov 25 2003

%E a(17)-a(21) from _Michael S. Branicky_, Dec 28 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)