|
Search: id:A090167
|
|
|
| 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. |
|
+0
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; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Herman Jamke, Table of n, a(n) for n = 0..80 [The complete list of terms]
Hugo Pfoertner, Solutions of small n*2 sliding block puzzles.
Takaken, 11-Puzzle Page.
Takaken, No. 62 (11 puzzles).
|
|
PROGRAM
|
See link in A089473.
|
|
CROSSREFS
|
Cf. A087725, A089473. Index of last sequence term: A090033. Other non-square sliding block puzzles: A090034, A090035, A090036, A090166.
Sequence in context: A018169 A131269 A047081 this_sequence A002985 A093608 A079976
Adjacent sequences: A090164 A090165 A090166 this_sequence A090168 A090169 A090170
|
|
KEYWORD
|
fini,nonn
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 27 2003
|
|
EXTENSIONS
|
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 22 2006
|
|
|
Search completed in 0.002 seconds
|
