# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a090167 Showing 1-1 of 1 %I A090167 #14 Jan 01 2021 03:21:50 %S A090167 1,2,3,6,11,20,36,60,95,155,258,426,688,1106,1723,2615,3901,5885,8851, %T A090167 13205,19508,28593,41179,58899,83582,118109,165136,228596,312542, %U A090167 423797,568233,755727,994641,1296097,1667002,2119476,2660415,3300586,4038877 %N 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. %H A090167 Herman Jamke, Table of n, a(n) for n = 0..80 (complete sequence) %H A090167 Hugo Pfoertner, Solutions of small n*2 sliding block puzzles. %H A090167 Takaken, 11-Puzzle Page. %H A090167 Takaken, No. 62 (11 puzzles). %o A090167 See link in A089473. %o A090167 (Python) # alst(), moves(), swap() in A089473 %o A090167 alst("-123456789AB", (6, 2), v=True) # _Michael S. Branicky_, Dec 31 2020 %Y A090167 Cf. A087725, A089473. Index of last sequence term: A090033. Other nonsquare sliding block puzzles: A090034, A090035, A090036, A090166. %K A090167 fini,full,nonn %O A090167 0,2 %A A090167 _Hugo Pfoertner_, Nov 27 2003 %E A090167 More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 22 2006 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE