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

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038097 Number of rooted connected graphs where root has degree 3. 3
32, 1120, 53760, 4155200, 550305280, 129990260736, 56369709634560, 45808126727193600, 70779622448719134720, 210103333009795298885632, 1207180278201294627140534272, 13500153139563948520744218001408 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,1

LINKS

Table of n, a(n) for n=4..15.

FORMULA

E.g.f.: B(x)/C(x) where B, C respectively are the e.g.f.'s for A038096 and A006125.

EXAMPLE

For n=4, take 4 nodes labeled a,b,c,d. We can choose the root in 4 ways, say a, and it must be joined to b,c,d. Each of the three edges bc, bd, cd may or may not exist, so there are 4*8 = 32 = a(4) possibilities.

CROSSREFS

Cf. A038094-A038096.

Sequence in context: A158685 A159360 A114933 * A208267 A184758 A189956

Adjacent sequences:  A038094 A038095 A038096 * A038098 A038099 A038100

KEYWORD

nonn,easy

AUTHOR

Christian G. Bower, Jan 04 1999. Suggested by Vlady Ravelomanana.

STATUS

approved

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

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

Last modified April 21 08:49 EDT 2014. Contains 240824 sequences.