|
| |
|
|
A092430
|
|
Number of n-node labeled connected mating graphs, cf. A006024.
|
|
5
| |
|
|
1, 1, 25, 438, 18388, 1409674, 206682994, 58152537184, 31715884061624, 33827568738189576, 71066571962396085656, 295645506683051376527648, 2444503529745123474354656720, 40269655263141217619453414445968
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,3
|
|
|
COMMENTS
| Number of n-node unlabeled connected mating graphs = number of n-node unlabeled connected graphs without endpoints, n>2; cf. A004108.
|
|
|
REFERENCES
| Goran Kilibarda, "Enumeration of unlabeled mating graphs", Belgrade, 2004, to be published.
|
|
|
LINKS
| Goran Kilibarda, Enumeration of Unlabeled Mating Graphs, Graphs and Combinatorics, Volume 23, Number 2 / April, 2007, pp. 183-199.
|
|
|
FORMULA
| E.g.f.: ln(Sum(2^binomial(n, 2)*ln(1+x)^n/n!, n=0..infinity)/(1+x)). a(n) = A079306(n)+(-1)^n*(n-1)!. - Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 28 2004
|
|
|
CROSSREFS
| Cf. A006024, A079306, A007833, A004108.
Cf. A059166.
Sequence in context: A180800 A004346 A021324 * A018207 A001714 A016633
Adjacent sequences: A092427 A092428 A092429 * A092431 A092432 A092433
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Goran Kilibarda, Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 22 2004
|
| |
|
|
