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!)
A090378 Number of configurations that require a minimum of n moves to be reached, starting with the empty square at mid-side of a boundary of an infinitely large extension of Sam Loyd's sliding block 15-puzzle. 1
1, 3, 7, 19, 53, 147 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Next term (unconfirmed): a(6)=409. If started with the empty square at mid-side of a boundary, the number of configurations reachable in the first floor((n-1)/2) moves in an n X n sliding block puzzle are given by this sequence.

LINKS

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

CROSSREFS

Cf. A089483 3 X 3 puzzle started with empty square at mid-side, A090165.

Sequence in context: A259812 A115254 A222324 * A007180 A059506 A007575

Adjacent sequences:  A090375 A090376 A090377 * A090379 A090380 A090381

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 | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 30 02:03 EDT 2020. Contains 337432 sequences. (Running on oeis4.)