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!)
A074045 Number of rooted trees of 2n+1 nodes with every leaf at height n. 2

%I #16 May 15 2019 05:53:50

%S 1,1,2,3,6,9,17,28,49,83,145,246,427,729,1256,2152,3702,6341,10892,

%T 18662,32016,54853,94034,161055,275929,472461,809033,1384848,2370434,

%U 4056309,6940744,11873769,20311018,34737781,59405959,101577454,173669088,296890268

%N Number of rooted trees of 2n+1 nodes with every leaf at height n.

%H Vaclav Kotesovec, <a href="/A074045/b074045.txt">Table of n, a(n) for n = 0..3500</a> (terms 0..250 from Alois P. Heinz)

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

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

%Y Limit of A048808-A048815.

%Y Cf. A244925.

%K nonn,eigen

%O 0,3

%A _Christian G. Bower_, Aug 13 2002. Suggested by _Paul D. Hanna_

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 2 21:27 EDT 2024. Contains 374875 sequences. (Running on oeis4.)