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.

Showing 1-5 of 5 results.

A010928 Binomial coefficient C(12,n).

Original entry on oeis.org

1, 12, 66, 220, 495, 792, 924, 792, 495, 220, 66, 12, 1
Offset: 0

Views

Author

N. J. A. Sloane

Keywords

Comments

Row 12 of A007318.
Also number of positions that are exactly n moves from the starting position in the Orbix Type 1 puzzle. 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 4096. Here positions differing by rotations or reflections are considered distinct.
If the sequence is extended by trailing zeros, its binomial transform yields A010965. - R. J. Mathar, Sep 19 2008

Links

Crossrefs

Cf. A010926-A011001, A080560-A080564.

Programs

Extensions

Edited by N. J. A. Sloane at the suggestion of Andrew S. Plewe, Jun 15 2007

A080564 Number of positions that are exactly n moves from the starting position in the Orbix Type 4 puzzle.

Original entry on oeis.org

1, 24, 30, 12, 180, 492, 735, 1460, 1101, 60
Offset: 0

Views

Author

N. J. A. Sloane, Feb 21 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 4096.

Links

Crossrefs

Cf. A010928, A080560-A080563.

A080563 Number of positions that are exactly n moves from the starting position in the Orbix Type 3 puzzle.

Original entry on oeis.org

1, 12, 30, 140, 291, 440, 660, 792, 727, 572, 302, 92, 37
Offset: 0

Views

Author

N. J. A. Sloane, Feb 21 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 4079.

Links

Crossrefs

Cf. A010928, A080560-A080564.

A080561 Number of positions that are exactly n moves from the starting position in the Orbix Type 1 puzzle.

Original entry on oeis.org

1, 1, 3, 5, 10, 12, 18, 12, 10, 5, 3, 1, 1
Offset: 0

Views

Author

N. J. A. Sloane, Feb 21 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 82. Here positions differing by rotations or reflections are considered the same.

Links

Crossrefs

Cf. A010928, A080560-A080564.

A080562 Number of positions that are exactly n moves from the starting position in the Orbix Type 2 puzzle.

Original entry on oeis.org

1, 12, 36, 80, 185, 300, 475, 480, 312, 152, 51
Offset: 0

Views

Author

N. J. A. Sloane, Feb 21 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 2079.

Links

Crossrefs

Cf. A010928, A080560-A080564.
Showing 1-5 of 5 results.

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

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