Skip to main content
12 events
when toggle format what by license comment
S May 11, 2017 at 8:46 history suggested Vincent CC BY-SA 3.0
removed some superfluous spaces that made the bottom two rows not look triangle-like any more. Now it looks better (at least in chrome on windows 7)
May 11, 2017 at 8:09 comment added Vincent Is there a rule to compute each entry from the two entries above as in Pascal's triangle?
May 11, 2017 at 8:07 review Suggested edits
S May 11, 2017 at 8:46
Oct 7, 2014 at 3:20 history edited Max Alekseyev CC BY-SA 3.0
oeis links updated
Apr 17, 2010 at 11:30 comment added Joel David Hamkins No problem, Hans, I know what you mean. I guess one way is to track down that reference.
Apr 17, 2010 at 2:22 comment added Hans-Peter Stricker @Joel: Sorry for not accepting your answer, but I am looking for the "idea" of counting those trees, not for the results only.
Apr 16, 2010 at 18:19 comment added Reid Barton To maybe save others some confusion: The top row is n=2, and the leftmost column is k=2.
Apr 16, 2010 at 17:13 comment added Joel David Hamkins I edited it to use a clearer representation of the data.
Apr 16, 2010 at 17:12 history edited Joel David Hamkins CC BY-SA 2.5
Used a different triangle to represent the data.
Apr 16, 2010 at 17:06 comment added Joel David Hamkins The OEIS is just for (one dimensional) sequences, but this is a two-dimensional function, having two arguments. So they organize it in a triangle.
Apr 16, 2010 at 16:59 comment added Hans-Peter Stricker I stumbled over this already, but couldn't make sense of the title: "the TRIANGLE of n nodes and k leaves". And the only reference - Harary's 'Graphical Enumeration' - is almost invisible at books.google.com. Are you sure?
Apr 16, 2010 at 16:50 history answered Joel David Hamkins CC BY-SA 2.5