id:A090377 - OEIS Search Results

Search: id:A090377

Displaying 1-1 of 1 results found.

page 1

Number of configurations that require a minimum of n moves to be reached, starting with the empty square in one of the corners of an infinitely large extension of Sam Loyd's sliding block 15-puzzle.

+0
1

1, 2, 4, 10, 26, 66, 173, 456, 1230, 3318 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`The first n terms of this sequence coincide with the first n terms of the corresponding sequences for n X n sliding block puzzles (see Cross-references).`
	CROSSREFS	`Cf. A089473 (3 X 3 puzzle), A089484 (4 X 4), A090031 (5 X 5), A090032 (6 X 6).` `Sequence in context: A090031 A055775 A090032 this_sequence A151278 A149810 A095337` `Adjacent sequences: A090374 A090375 A090376 this_sequence A090378 A090379 A090380`
	KEYWORD	`more,nonn`
	AUTHOR	`Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 27 2003`

page 1

Search completed in 0.002 seconds

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research