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

A084107 A014486-encoding of "Complete Binary Trees".

Original entry on oeis.org

0, 2, 50, 14642, 1016674610, 4489135110542145842, 83940259113354708787282267381662562610, 28755706180189132304920279902696353117047700481289459579932708798287463397682
Offset: 0

Views

Author

Antti Karttunen, May 13 2003

Keywords

Comments

"Complete" or "full binary tree" refers to a unique binary tree of (2^n)-1 nodes with its 2^(n-1) leaves all on the same height (or depth) n-1 (when the root is at height 0). These are depicted at A073346. This differs from "completely binary tree", with which some authors refer to trees more akin to the trees encoded by A080299.

Links

Crossrefs

a(n) = A014486(A084108(n)). Subset of A083941.

A083940 A014486-indices of symmetric binary trees.

Original entry on oeis.org

0, 1, 6, 43, 51, 389, 416, 477, 504, 551, 4102, 4191, 4397, 4485, 4649, 5100, 5187, 5393, 5481, 5645, 5964, 6051, 6215, 6489, 47404, 47700, 48403, 48697, 49268, 50833, 51126, 51828, 52120, 52691, 53829, 54120, 54690, 55690, 59334, 59627, 60328
Offset: 0

Views

Author

Antti Karttunen, May 13 2003

Keywords

Comments

Fixed points of permutation A057163.

Crossrefs

a(n) = A080300(A083941(n)). Cf. A083938, A084108.

Formula

a(0)=0, a(n)=A072764bi(n-1, A057163(n-1)).
Showing 1-2 of 2 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.