[seqfan] Re: 2d gf's

[Leonard Smiley]

"Christian G.Bower" wrote:

> ____________________________________________________________________
> Get free email and a permanent address at http://www.netaddress.com/?N=1
>
>   ------------------------------------------------------------------------
> I wrote:
>
> > I looked at these two sequences counting the aggregate number of leaves
> > in rooted trees and trees.
> >
> > ID Number: A003227 (Formerly M2744)
> ...
> > ID Number: A003228 (Formerly M0351)
> ...
> > My calculations agree with those above for n=1 to 21, but for n=22
> ...
>
> I contacted Bob Robinson. He recalculated the values and discovered that
> mine were correct. So this issue is settled.
>
> Christian

For ordered trees with n edges, the aggregate number of leaves is
A001700(n-1). This was Problem 10753 in the American Mathematical Monthly,
although it was anticipated by Dershowitz and Zaks, Discrete Math. 31, p.18.

Len