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!)
A090165 Number of configurations of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square at one of the 8 non-corner boundary squares. 3
1, 3, 6, 14, 32, 66, 134, 280, 585, 1214, 2462, 4946, 9861, 19600, 38688, 76086, 148435, 288098, 554970, 1062628, 2016814, 3800682, 7093209, 13127364, 24053454, 43657576, 78382622, 139237375 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
PROG
See link in A089473.
(Python) # uses alst(), swap() in A089473
start, shape = "1-23456789ABCDEF", (4, 4)
print(alst(start, shape, maxd=16)) # Michael S. Branicky, Jan 02 2021
CROSSREFS
Sequence in context: A006356 A077998 A209357 * A129954 A238768 A272362
KEYWORD
fini,more,nonn
AUTHOR
Hugo Pfoertner, Nov 27 2003
EXTENSIONS
a(17)-a(27) from Michael S. Branicky, Dec 28 2020
STATUS
approved

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 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)