login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090377 Number of configurations that require a minimum of n moves to be reached, starting with the empty square in one of the corners of an infinitely large extension of Sam Loyd's sliding block 15-puzzle. 0
1, 2, 4, 10, 26, 66, 173, 456, 1230, 3318 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

The first n terms of this sequence coincide with the first n terms of the corresponding sequences for n X n sliding block puzzles (see Cross-references).

LINKS

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

CROSSREFS

Cf. A089473 (3 X 3 puzzle), A089484 (4 X 4), A090031 (5 X 5), A090032 (6 X 6).

Sequence in context: A239076 A217988 A090032 * A151278 A149810 A095337

Adjacent sequences:  A090374 A090375 A090376 * A090378 A090379 A090380

KEYWORD

more,nonn

AUTHOR

Hugo Pfoertner, Nov 27 2003

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified April 23 11:22 EDT 2014. Contains 240919 sequences.