Comments on: The On-Line Encyclopedia of Integer Sequences http://ripper234.com/p/the-on-line-encyclopedia-of-integer-sequences/ Stuff Ron Gross Finds Interesting Fri, 03 Sep 2010 17:22:07 +0000 hourly 1 http://wordpress.org/?v=3.0 By: Adam Morrison http://ripper234.com/p/the-on-line-encyclopedia-of-integer-sequences/comment-page-1/#comment-374 Adam Morrison Tue, 18 Mar 2008 15:28:00 +0000 http://localhost/p/the-on-line-encyclopedia-of-integer-sequences/#comment-374 It was me, didn't notice the option to leave a name instead of being anonymous. It was me, didn’t notice the option to leave a name instead of being anonymous.

]]> By: ripper234 http://ripper234.com/p/the-on-line-encyclopedia-of-integer-sequences/comment-page-1/#comment-373 ripper234 Mon, 17 Mar 2008 14:18:00 +0000 http://localhost/p/the-on-line-encyclopedia-of-integer-sequences/#comment-373 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. Right you are, thanks :)
I’m curious, who is this?

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.

]]> By: Anonymous http://ripper234.com/p/the-on-line-encyclopedia-of-integer-sequences/comment-page-1/#comment-372 Anonymous Mon, 17 Mar 2008 14:10:00 +0000 http://localhost/p/the-on-line-encyclopedia-of-integer-sequences/#comment-372 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. 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.

]]>