login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080615 Consider 3 X 3 X 3 Rubik cube, but only allow the moves T2, D2, F2, B2; sequence gives number of positions that are exactly n moves from the start. 1
1, 4, 10, 24, 53, 64, 31, 4, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Not every position can be reached using this restricted set of moves. Total number of positions that can be reached = 192.
LINKS
CROSSREFS
Cf. A080601, A080614, etc.
Sequence in context: A107659 A162588 A280541 * A173729 A340569 A097976
KEYWORD
nonn,fini,full
AUTHOR
N. J. A. Sloane, Feb 26 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 17 14:54 EDT 2024. Contains 375987 sequences. (Running on oeis4.)