Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090378
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
2
1, 3, 7, 19, 53, 147 (list; graph; listen)
OFFSET

0,2

COMMENT

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.

CROSSREFS

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

Sequence in context: A135052 A146597 A115254 this_sequence A007180 A059506 A007575

Adjacent sequences: A090375 A090376 A090377 this_sequence A090379 A090380 A090381

KEYWORD

more,nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 27 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research