|
Search: id:A094594
|
|
|
| A094594 |
|
Total number of edges in all connected labeled graphs on n nodes. |
|
+0
1
|
|
| 0, 1, 9, 144, 4140, 214200, 20264832, 3580049088, 1202974894656, 779257681804800, 982078160760512640, 2423077679970846226944, 11755368773275419420291072, 112487517660848696830655493120
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
FORMULA
|
E.g.f.: A(x)/B(x), where A(x) is e.g.f. of A095351 and B(x) is e.g.f. of A006125. recurrence: a(n) = binomial(n, 2)*2^(binomial(n, 2)-1) - Sum(binomial(n, k)*2^binomial(n-k, 2)*a(k), k=1..n-1).
|
|
MAPLE
|
a[1]:=0: for n from 1 to 16 do a[n]:= binomial(n, 2)*2^(binomial(n, 2)-1)-sum(binomial(n, k)*2^binomial(n-k, 2)*a[k], k=1..n-1) od: seq(a[n], n=1..16); (Deutsch)
|
|
CROSSREFS
|
Sequence in context: A067415 A069134 A034829 this_sequence A046529 A064091 A132060
Adjacent sequences: A094591 A094592 A094593 this_sequence A094595 A094596 A094597
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 06 2004
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 18 2004
|
|
|
Search completed in 0.002 seconds
|
