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.

A052120 Number of 3-valent trees (= boron trees or binary trees) with n nodes.

Original entry on oeis.org

1, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 2, 0, 4, 0, 6, 0, 11, 0, 18, 0, 37, 0, 66, 0, 135, 0, 265, 0, 552, 0, 1132, 0, 2410, 0, 5098, 0, 11020, 0, 23846, 0
Offset: 1

Views

Author

Keywords

Comments

Trees with n nodes each of valency either 1 or 3.

Crossrefs

See A000672, the subsequence of even-numbered terms, which is the main entry for this sequence, for more terms, references, etc.