login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052301 Number of asymmetric rooted Greg trees. 3
1, 1, 2, 5, 14, 43, 138, 455, 1540, 5305, 18546, 65616, 234546, 845683, 3072350, 11235393, 41326470, 152793376, 567518950, 2116666670, 7924062430, 29765741831, 112157686170, 423809991041, 1605622028100, 6097575361683 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

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

LINKS

Index entries for sequences related to rooted trees

N. J. A. Sloane, Transforms

FORMULA

Satisfies a=WEIGH(a)+SHIFT_RIGHT(WEIGH(a))-a.

CROSSREFS

Essentially the same as A031148. Cf. A005263, A005264, A048159, A048160, A052300-A052303.

Sequence in context: A071743 A071747 A071751 * A071755 A149879 A149880

Adjacent sequences:  A052298 A052299 A052300 * A052302 A052303 A052304

KEYWORD

nonn,eigen

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 18:41 EST 2012. Contains 206074 sequences.