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.

A060131 a(n) = A072411(A275725(n)); order of each permutation listed in tables A060117 and A060118, i.e., the least common multiple of the cycle sizes.

Original entry on oeis.org

1, 2, 2, 3, 2, 3, 2, 2, 3, 4, 3, 4, 2, 3, 3, 4, 2, 4, 2, 3, 2, 4, 3, 4, 2, 2, 2, 6, 2, 6, 3, 6, 4, 5, 4, 5, 3, 4, 4, 5, 6, 5, 3, 4, 6, 5, 4, 5, 2, 2, 3, 4, 3, 4, 3, 6, 4, 5, 4, 5, 2, 6, 4, 5, 6, 5, 2, 6, 6, 5, 4, 5, 2, 3, 3, 4, 2, 4, 2, 6, 4, 5, 6, 5, 3, 4, 4, 5, 6, 5, 2, 4, 6, 5, 6, 5, 2, 3, 2, 4, 3, 4, 2, 6, 6, 5, 4, 5, 2, 4, 6, 5, 6, 5, 3, 4, 6, 5, 4, 5, 2
Offset: 0

Views

Author

Antti Karttunen, Mar 05 2001

Keywords

Crossrefs

Cf. A261220 (gives the positions of 1 and 2's).
Cf. A275813 (indices of odd terms), A275814 (indices of even terms).

Programs

Formula

From Antti Karttunen, Aug 09 2016: (Start)
a(n) = A072411(A275725(n)).
a(n) = A055092(A060120(n)).
(End)