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-3 of 3 results.

A081148 Number of odd cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506.

Original entry on oeis.org

1, 1, 0, 1, 0, 4, 0, 9, 0, 24, 0, 62, 0, 162, 0, 447, 0, 1234, 0
Offset: 0

Views

Author

Wouter Meeussen and Antti Karttunen, Mar 10 2003

Keywords

Comments

For the convenience of the range notation above, we define A014137(-1) and A014138(-1) as zero.

Links

Crossrefs

Bisection: A081149.
Cf. A081153, A081155, A057507, A081150.
Cf. A014137, A014138, A057505, A057506.

Formula

a(n) = A081153(n) + A081155(n) = A057507(n) - A081150(n).

A081155 Number of odd cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with fixed-points of both A057163 and A057164.

Original entry on oeis.org

1, 1, 0, 1, 0, 2, 0, 3, 0, 6, 0, 12, 0, 20, 0, 59, 0, 120, 0
Offset: 0

Views

Author

Wouter Meeussen and Antti Karttunen, Mar 10 2003

Keywords

Comments

See comment at A080973. Because A057163 can fix only binary trees of odd size, the even-indexed terms are all 0 after n>0.

Crossrefs

Bisection: A081156.
Cf. A081148, A081153.
Cf. A014137, A014138, A057505, A057506, A057163, A057164.

Formula

a(n) = A081148(n)-A081153(n).

A081154 Number of odd cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506, with no fixed points of either A057163 or A057164.

Original entry on oeis.org

0, 0, 2, 6, 18, 50, 142, 388, 1114
Offset: 0

Views

Author

Wouter Meeussen and Antti Karttunen, Mar 10 2003

Keywords

Crossrefs

Cf. A081153, A014137, A014138, A057505, A057506, A057163, A057164.

Formula

a(n) = A081153(2n+1).
Showing 1-3 of 3 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.