id:A090031 - OEIS Search Results

Search: id:A090031

Displaying 1-1 of 1 results found.

page 1

Number of configurations of the 5 X 5 variant of sliding block 15-puzzle ("24-puzzle") that require a minimum of n moves to be reached, starting with the empty square in one of the corners.

+0
7

1, 2, 4, 10, 26, 64, 159, 366, 862, 1904, 4538, 10238, 24098, 53186, 123435, 268416, 616374 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`The 15-block puzzle is often referred to (incorrectly) as Sam Loyd's 15-Puzzle.` `114 <= (number of last sequence term) <= 210. Sum of sequence terms=A088020(5)/2.`
	REFERENCES	`See A087725 for references.`
	LINKS	`Hugo Pfoertner, Configuration counts for n*n sliding block puzzles.`
	PROGRAM	`See link in A089473.`
	CROSSREFS	`Cf. A087725, A089473, A089484, A090032.` `Sequence in context: A007021 A100605 A154322 this_sequence A055775 A090032 A090377` `Adjacent sequences: A090028 A090029 A090030 this_sequence A090032 A090033 A090034`
	KEYWORD	`fini,hard,more,nonn`
	AUTHOR	`Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 25 2003`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research