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!)
A245103 Number of (2n+1)-node rooted trees of height n. 3

%I #9 Dec 18 2020 06:32:52

%S 1,1,4,18,93,498,2744,15349,86802,494769,2837412,16351036,94599339,

%T 549118128,3196397701,18651028188,109057492901,638863803720,

%U 3748605725140,22027421351633,129606128716906,763484925360476,4502370205339221,26577052185126059

%N Number of (2n+1)-node rooted trees of height n.

%H Alois P. Heinz, <a href="/A245103/b245103.txt">Table of n, a(n) for n = 0..200</a>

%F a(n) = A034781(2n+1,n).

%F a(n) ~ c * d^n / sqrt(n), where d = 6.0313827950978605329935... (same as for A245102 and A339440), c = 0.14566140512597547487... . - _Vaclav Kotesovec_, Jul 12 2014

%Y Cf. A034781.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Jul 11 2014

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 August 23 14:02 EDT 2024. Contains 375396 sequences. (Running on oeis4.)