A324770 Number of fully anti-transitive rooted identity trees with n nodes.

1, 1, 1, 1, 2, 3, 6, 13, 27, 58, 128, 286, 640, 1452, 3308, 7594, 17512, 40591, 94449, 220672

Offset: 1

Author

Gus Wiseman, Mar 17 2019

Keywords

• nonn
• more

Comments

An unlabeled rooted tree is fully anti-transitive if no proper terminal subtree of any branch of the root is a branch of the root. It is an identity tree if there are no repeated branches directly under the same root.

Examples

			The a(1) = 1 through a(7) = 6 fully anti-transitive rooted identity trees:
  o  (o)  ((o))  (((o)))  ((o(o)))   (((o(o))))   ((o(o(o))))
                          ((((o))))  ((o((o))))   ((((o(o)))))
                                     (((((o)))))  (((o)((o))))
                                                  (((o((o)))))
                                                  ((o(((o)))))
                                                  ((((((o))))))
		

Links

• Gus Wiseman, The a(11) = 128 fully anti-transitive rooted identity trees.

Crossrefs

Cf. A000081, A004111, A276625, A279861, A290760, A304360, A306844.

Cf. A324695, A324751, A324763, A324764, A324765, A324767, A324769.

Cf. A324839, A324840, A324843, A324844, A324846.

Programs

Mathematica

idall[n_]:=If[n==1,{{}},Select[Union[Sort/@Join@@(Tuples[idall/@#]&/@IntegerPartitions[n-1])],UnsameQ@@#&]];
Table[Length[Select[idall[n],Intersection[Union@@Rest[FixedPointList[Union@@#&,#]],#]=={}&]],{n,10}]