|
Search: id:A035052
|
|
|
| A035052 |
|
Number of sets of rooted connected graphs where every block is a complete graph. |
|
+0
2
|
|
| 1, 1, 2, 5, 14, 42, 134, 444, 1518, 5318, 18989, 68856, 252901, 938847, 3517082, 13278844, 50475876, 193014868, 741963015, 2865552848, 11113696421, 43266626430, 169019868095, 662337418989, 2602923589451, 10256100717875
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..200
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 862
N. J. A. Sloane, Transforms
|
|
FORMULA
|
Euler transform of A007563.
|
|
MAPLE
|
with (numtheory): etr:= proc(p) local b; b:=proc(n) option remember; `if`(n=0, 1, add (add (d*p(d), d=divisors(j)) *b(n-j), j=1..n)/n) end end: b:= etr(aa): c:= etr(b): aa:= n-> if n=0 then 0 else c(n-1) fi: a:= etr (aa): seq (a(n), n=0..25); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 09 2008]
|
|
CROSSREFS
|
Cf. A007549, A007563, A030019, A035051, A035053.
Sequence in context: A162748 A061815 A129086 this_sequence A148330 A149876 A165146
Adjacent sequences: A035049 A035050 A035051 this_sequence A035053 A035054 A035055
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Christian G. Bower (bowerc(AT)usa.net), Oct 15 1998.
|
|
|
Search completed in 0.002 seconds
|
