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.

A316501 Number of unlabeled rooted trees with n nodes in which the branches of any node with more than one distinct branch have empty intersection.

Original entry on oeis.org

1, 1, 2, 4, 9, 19, 45, 103, 250, 611, 1528, 3853, 9875, 25481, 66382, 174085, 459541, 1219462
Offset: 1

Views

Author

Gus Wiseman, Jul 05 2018

Keywords

Examples

			The a(6) = 19 rooted trees:
  (((((o)))))
  ((((oo))))
  (((o(o))))
  (((ooo)))
  ((o((o))))
  ((o(oo)))
  (((o)(o)))
  ((oo(o)))
  ((oooo))
  (o(((o))))
  (o((oo)))
  (o(o(o)))
  (o(ooo))
  ((o)((o)))
  (oo((o)))
  (oo(oo))
  (o(o)(o))
  (ooo(o))
  (ooooo)
		

Crossrefs

Programs

  • Mathematica
    strut[n_]:=strut[n]=If[n===1,{{}},Select[Join@@Function[c,Union[Sort/@Tuples[strut/@c]]]/@IntegerPartitions[n-1],Or[Length[Union[#]]==1,Intersection@@#=={}]&]];
    Table[Length[strut[n]],{n,15}]