The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052120 Number of 3-valent trees (= boron trees or binary trees) with n nodes. 1

%I #12 Mar 06 2020 00:04:05

%S 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,

%T 552,0,1132,0,2410,0,5098,0,11020,0,23846,0

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

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

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CayleyTree.html">Cayley Tree.</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/TrivalentTree.html">Trivalent Tree</a>

%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>

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

%K nonn,easy

%O 1,10

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 23:39 EDT 2024. Contains 372608 sequences. (Running on oeis4.)