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.

A324979 Number of rooted trees with n vertices that are not identity trees but whose non-leaf terminal subtrees are all different.

Original entry on oeis.org

0, 0, 1, 2, 5, 12, 29, 70, 168, 402, 959, 2284, 5434, 12923, 30727, 73055, 173678, 412830
Offset: 1

Views

Author

Gus Wiseman, Mar 21 2019

Keywords

Comments

An unlabeled rooted tree is an identity tree if there are no repeated branches directly under the same root.

Examples

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

Crossrefs

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

Programs

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