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!)
A245102 Number of 2n-node rooted trees of height n. 4

%I #8 Jul 12 2014 03:42:13

%S 0,1,2,8,36,180,941,5079,27961,156129,880883,5009625,28668920,

%T 164897622,952418882,5520254925,32090787577,187030223470,

%U 1092467751427,6393706661582,37484034980109,220093799592140,1294100839792723,7618482099893824,44901233075819275

%N Number of 2n-node rooted trees of height n.

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

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

%F a(n) ~ c * d^n / sqrt(n), where d = 6.0313827950978605329935..., c = 0.03944957121899527... . - _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 April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)