Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092430
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092430 Number of n-node labeled connected mating graphs, cf. A006024. +0
6
1, 1, 25, 438, 18388, 1409674, 206682994, 58152537184, 31715884061624, 33827568738189576, 71066571962396085656, 295645506683051376527648, 2444503529745123474354656720, 40269655263141217619453414445968 (list; graph; listen)
OFFSET

2,3

COMMENT

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: A019722 A004346 A021324 this_sequence A018207 A001714 A016633

Adjacent sequences: A092427 A092428 A092429 this_sequence A092431 A092432 A092433

KEYWORD

nonn

AUTHOR

Goran Kilibarda, Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 22 2004

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 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research