Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052303
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052303 Number of asymmetric Greg trees. +0
8
1, 1, 0, 0, 0, 0, 1, 4, 12, 42, 137, 452, 1491, 4994, 16831, 57408, 197400, 685008, 2395310, 8437830, 29917709, 106724174, 382807427, 1380058180, 4998370015, 18181067670, 66393725289, 243347195594, 894959868983, 3301849331598 (list; graph; listen)
OFFSET

0,8

COMMENT

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.

LINKS

Index entries for sequences related to trees

FORMULA

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

CROSSREFS

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

Sequence in context: A149341 A149342 A149343 this_sequence A017942 A149344 A135489

Adjacent sequences: A052300 A052301 A052302 this_sequence A052304 A052305 A052306

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research