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.

A324838 Number of unlabeled rooted trees with n nodes where the branches of no branch of the root form a submultiset of the branches of the root.

Original entry on oeis.org

1, 0, 1, 2, 5, 10, 28, 64, 169, 422, 1108, 2872, 7627, 20202, 54216, 145867, 395288
Offset: 1

Views

Author

Gus Wiseman, Mar 18 2019

Keywords

Examples

			The a(1) = 1 through a(6) = 10 rooted trees:
  o  ((o))  ((oo))   ((ooo))    ((oooo))
            (((o)))  (((oo)))   (((ooo)))
                     ((o)(o))   ((o)(oo))
                     ((o(o)))   ((o(oo)))
                     ((((o))))  ((oo(o)))
                                ((((oo))))
                                (((o)(o)))
                                (((o(o))))
                                ((o((o))))
                                (((((o)))))
		

Crossrefs

Programs

  • Mathematica
    submultQ[cap_,fat_]:=And@@Function[i,Count[fat,i]>=Count[cap,i]]/@Union[List@@cap];
    rtall[n_]:=Union[Sort/@Join@@(Tuples[rtall/@#]&/@IntegerPartitions[n-1])];
    Table[Length[Select[rtall[n],And@@Table[!submultQ[b,#],{b,#}]&]],{n,10}]