login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089483 Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square at mid-side. 3
1, 3, 5, 10, 14, 28, 42, 80, 108, 202, 278, 524, 726, 1348, 1804, 3283, 4193, 7322, 8596, 13930, 14713, 21721, 19827, 25132, 18197, 18978, 9929, 7359, 2081, 878, 126, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

See A087725.

LINKS

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

Hugo Pfoertner, Table of solution lengths of the 8-puzzle

EXAMPLE

Starting with

1-2

345

678

the two final configurations requiring 31 moves are

86- ... -86

547 and 743

231 ... 251

MAPLE

See link in A089473.

CROSSREFS

Cf. A089473, A089474, A089484, A087725, A090031.

Sequence in context: A319066 A306319 A182722 * A323858 A190484 A190545

Adjacent sequences:  A089480 A089481 A089482 * A089484 A089485 A089486

KEYWORD

fini,full,nonn

AUTHOR

Hugo Pfoertner, Nov 19 2003

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 5 23:11 EDT 2020. Contains 333260 sequences. (Running on oeis4.)