This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A052302 Number of Greg trees. 4

%I

%S 1,1,1,2,5,12,37,116,412,1526,5995,24284,101619,434402,1893983,

%T 8385952,37637803,170871486,783611214,3625508762,16906577279,

%U 79395295122,375217952457,1783447124452,8521191260092,40907997006020,197248252895597,954915026282162

%N Number of Greg trees.

%C 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.

%H Alois P. Heinz, <a href="/A052302/b052302.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>

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

%p b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,

%p end:

%p g:= n-> `if`(n<1, 0, b(n-1\$2)+b(n, n-1)):

%p a:= n-> `if`(n=0, 1, g(n)-add(g(j)*g(n-j), j=0..n)):

%p seq(a(n), n=0..40); # _Alois P. Heinz_, Jun 22 2018

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

%K nonn

%O 0,4

%A _Christian G. Bower_, Nov 15 1999

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 16 09:06 EST 2019. Contains 330020 sequences. (Running on oeis4.)