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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090167 Number of configurations of the 6 X 2 variant of the so-called "Sam Loyd" sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners. 5
1, 2, 3, 6, 11, 20, 36, 60, 95, 155, 258, 426, 688, 1106, 1723, 2615, 3901, 5885, 8851, 13205, 19508, 28593, 41179, 58899, 83582, 118109, 165136, 228596, 312542, 423797, 568233, 755727, 994641, 1296097, 1667002, 2119476, 2660415, 3300586, 4038877 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Herman Jamke, Table of n, a(n) for n = 0..80 (complete sequence)

Hugo Pfoertner, Solutions of small n*2 sliding block puzzles.

Takaken, 11-Puzzle Page.

Takaken, No. 62 (11 puzzles).

PROG

See link in A089473.

CROSSREFS

Cf. A087725, A089473. Index of last sequence term: A090033. Other nonsquare sliding block puzzles: A090034, A090035, A090036, A090166.

Sequence in context: A242842 A131269 A047081 * A002985 A239342 A093608

Adjacent sequences:  A090164 A090165 A090166 * A090168 A090169 A090170

KEYWORD

fini,full,nonn

AUTHOR

Hugo Pfoertner, Nov 27 2003

EXTENSIONS

More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 22 2006

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 June 17 05:19 EDT 2019. Contains 324183 sequences. (Running on oeis4.)