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.

User: Y. Z. Chen

Y. Z. Chen's wiki page.

Y. Z. Chen has authored 2 sequences.

A229069 Group cyclic numbers.

Original entry on oeis.org

32258064516129, 354838709677419, 23255813953488372093, 46511627906976744186, 2830188679245, 5660377358490, 1698113207547, 2264150943396, 164179104477611940298507462686567, 283582089552238805970149253731343
Offset: 1

Views

Author

Y. Z. Chen, Sep 12 2013

Keywords

Examples

			Every group has the same digits, and they are "cyclic numbers" in its group, not only the number itself.

Crossrefs

Cf. A001913.

A210243 Hanoi solutions (odd), the disks are moved from pillar 1 to pillar 3. For disks = 2k+1 use the first 2^(2k+2)-2 number pairs.

Original entry on oeis.org

1, 3, 1, 2, 3, 2, 1, 3, 2, 1, 2, 3, 1, 3, 1, 2, 3, 2, 3, 1, 2, 1, 3, 2, 1, 3, 1, 2, 3, 2, 1, 3, 2, 1, 2, 3, 1, 3, 2, 1, 3, 2, 3, 1, 2, 1, 2, 3, 1, 3, 1, 2, 3, 2, 1, 3, 2, 1, 2, 3, 1, 3, 1, 2, 3, 2, 3, 1, 2, 1, 3, 2, 1, 3, 1, 2, 3, 2, 3, 1, 2, 1, 2, 3, 1, 3, 2
Offset: 1

Views

Author

Y. Z. Chen, Mar 24 2012

Keywords

Examples

			The solution to Hanoi with 3 disks from pillar 1 to pillar 3 is (1,3), (1,2), (3,2), (1,3), (2,1), (2,3), (1,3).

Links

Crossrefs

If the number of disks is even see A101608.

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

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