Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090032
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090032 Number of configurations of the 6 X 6 variant of Sam Loyd's sliding block 15-puzzle ("35-puzzle") that require a minimum of n moves to be reached, starting with the empty square in one of the corners. +0
4
1, 2, 4, 10, 26, 66, 171, 440, 1112, 2786, 6820, 16720, 41106, 100856, 245793, 597030, 1441292 (list; graph; listen)
OFFSET

0,2

REFERENCES

See A087725.

LINKS

Hugo Pfoertner, Configuration counts for n*n sliding block puzzles.

PROGRAM

See link in A089473.

CROSSREFS

Cf. A087725, A089473, A089484, A090031.

Sequence in context: A154322 A090031 A055775 this_sequence A090377 A151278 A149810

Adjacent sequences: A090029 A090030 A090031 this_sequence A090033 A090034 A090035

KEYWORD

fini,hard,more,nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 25 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research