0,4

A Greg tree can be described as a tree with 2-colored nodes where only the black nodes are counted and the white nodes are of degree at least 3.

Index entries for sequences related to trees

G.f.: 1+B(x)-B(x)^2 where B(x) is g.f. of A052300.

Cf. A005263, A005264, A048159, A048160, A052300-A052303.

Sequence in context: A032203 A094717 A038142 this_sequence A009598 A002216 A024717

Adjacent sequences: A052299 A052300 A052301 this_sequence A052303 A052304 A052305

nonn

Christian G. Bower (bowerc(AT)usa.net), Nov 15 1999.