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.

A080293 A014486-encoding of the branch-reduced binomial-mod-2 binary trees.

Original entry on oeis.org

2, 50, 14642, 3969842, 267572689202, 69427226972978, 4581045692538239282, 301220569271221714981682, 1295918094920364850246919050705202, 332029112115571675270693117549056818
Offset: 0

Views

Author

Antti Karttunen, Mar 02 2003

Keywords

Comments

These are obtained from the stunted binomial-mod-2 zigzag trees (A080263) either by extending each leaf to a branch of two leaves, or by branch-reducing every other such tree.

Crossrefs

a(n) = A014486(A080295(n)). Same sequence in binary: A080294. Breadth-first-wise encoding: A080318. "Moose-trees" obtained from these: A080973. Cf. A080292, A080297.

Formula

A080311 Orbit size of each tree encoded by A014486(n) under Meeussen's bf<->df map on binary trees.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 3, 3, 3, 1, 1, 3, 3, 3, 4, 3, 2, 4, 3, 4, 3, 2, 4, 1, 1, 3, 3, 3, 4, 3, 2, 4, 3, 4, 3, 2, 4, 16, 16, 8, 16, 8, 2, 2, 16, 16, 16, 8, 8, 8, 16, 16, 16, 16, 8, 8, 16, 8, 2, 2, 16, 16, 16, 16, 16, 1, 1, 3, 3, 3, 4, 3, 2, 4, 3, 4, 3, 2, 4, 16, 16, 8, 16, 8, 2, 2, 16, 16, 16, 8, 8, 8, 16
Offset: 0

Views

Author

Antti Karttunen, Mar 02 2003

Keywords

Comments

This is the size of the cycle containing n in the permutations A057117/A057118.

Crossrefs

A080273 Orbit size of each tree A080263(n) under Meeussen's bf<->df map on binary trees.

Original entry on oeis.org

1, 3, 16, 1441, 41888, 3376173
Offset: 0

Views

Author

Antti Karttunen, Mar 02 2003

Keywords

Comments

This is the size of the cycle containing A080265(n) in the permutations A057117/A057118.

Crossrefs

Formula

a(n) = A080311(A080265(n)).
Showing 1-3 of 3 results.