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!)
A089474 Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square in the center. 2
1, 4, 8, 8, 16, 32, 60, 72, 136, 200, 376, 512, 964, 1296, 2368, 3084, 5482, 6736, 11132, 12208, 18612, 18444, 24968, 19632, 22289, 13600, 11842, 4340, 2398, 472, 148 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

See A087725.

LINKS

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

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

EXAMPLE

Starting with

123

4-5

678

two of the 148 configurations that require the maximum of 30 moves are

476 ... -86

2-8 and 724

351 ... 351

MAPLE

See link in A089473.

CROSSREFS

Cf. A089473, A089483, A089484, A087725, A090031.

Sequence in context: A098354 A209382 A298119 * A141800 A019197 A066106

Adjacent sequences:  A089471 A089472 A089473 * A089475 A089476 A089477

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 August 7 19:57 EDT 2020. Contains 336279 sequences. (Running on oeis4.)