tag:blogger.com,1999:blog-3641398491457326290.post8763130785729283201..comments2023-07-20T12:00:15.510+03:00Comments on A Quantum Immortal: The On-Line Encyclopedia of Integer Sequencesripper234http://www.blogger.com/profile/04249942902466482054noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-3641398491457326290.post-37127088199996428132008-03-18T17:28:00.000+02:002008-03-18T17:28:00.000+02:00It was me, didn't notice the option to leave a nam...It was me, didn't notice the option to leave a name instead of being anonymous.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3641398491457326290.post-23186919578282996452008-03-17T16:18:00.000+02:002008-03-17T16:18:00.000+02:00Right you are, thanks :)I'm curious, who is this?W...Right you are, thanks :)<BR/>I'm curious, who is this?<BR/><BR/>What I immediately found in Wikipedia is the number of unrooted trees is n^{n-2}, but I didn't make the trivial jump to rooted trees.ripper234https://www.blogger.com/profile/04249942902466482054noreply@blogger.comtag:blogger.com,1999:blog-3641398491457326290.post-17980250840142366452008-03-17T16:10:00.000+02:002008-03-17T16:10:00.000+02:00The number of labeled trees on n nodes, which is n...The number of labeled trees on n nodes, which is n^{n-2} by Prüfer's theorem, times n for the selection of which label is the root.Anonymousnoreply@blogger.com