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!)
A322752 Number of "funny trees" on n nodes. 0

%I #7 Dec 25 2018 22:35:58

%S 0,2,3,9,30,110,423

%N Number of "funny trees" on n nodes.

%C For precise definition see Example 15.3.7 of Bona (2015).

%D Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 1002.

%K nonn,more

%O 1,2

%A _N. J. A. Sloane_, Dec 25 2018

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 September 10 08:22 EDT 2024. Contains 375785 sequences. (Running on oeis4.)