cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A324936 Number of unlabeled rooted trees with n vertices whose non-leaf terminal subtrees are all different.

Original entry on oeis.org

1, 1, 2, 4, 8, 17, 37, 83, 189, 436, 1014, 2373, 5578, 13156, 31104, 73665, 174665, 414427, 983606, 2334488
Offset: 1

Views

Author

Gus Wiseman, Mar 21 2019

Keywords

Comments

The Matula-Goebel numbers of these trees are given by A324935.

Examples

			The a(1) = 1 through a(6) = 17 trees:
  o  (o)  (oo)   (ooo)    (oooo)     (ooooo)
          ((o))  ((oo))   ((ooo))    ((oooo))
                 (o(o))   (o(oo))    (o(ooo))
                 (((o)))  (oo(o))    (oo(oo))
                          (((oo)))   (ooo(o))
                          ((o(o)))   (((ooo)))
                          (o((o)))   ((o)(oo))
                          ((((o))))  ((o(oo)))
                                     ((oo(o)))
                                     (o((oo)))
                                     (o(o(o)))
                                     (oo((o)))
                                     ((((oo))))
                                     (((o(o))))
                                     ((o((o))))
                                     (o(((o))))
                                     (((((o)))))
		

Crossrefs

Programs

  • Mathematica
    durt[n_]:=Join@@Table[Select[Union[Sort/@Tuples[durt/@ptn]],UnsameQ@@Cases[#,{},{0,Infinity}]&],{ptn,IntegerPartitions[n-1]}];
    Table[Length[durt[n]],{n,10}]