cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A079746 Number of positions that are exactly n moves from the starting position in the Halpern-Meier Pyramid puzzle.

Original entry on oeis.org

1, 8, 48, 288, 1728, 10128, 57780, 305483, 1239266, 1879631, 237320, 778, 21
Offset: 0

Views

Author

N. J. A. Sloane, Feb 20 2003

Keywords

Comments

This is the number of positions that can be reached in n moves from the start, but which cannot be reached in fewer than n moves.
A puzzle in the Rubik cube family. The total number of distinct positions is 3732480

Links

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.