Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014500
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014500 Number of graphs with unlabeled (non-isolated) nodes and n labeled edges. +0
5
1, 1, 2, 9, 70, 794, 12055, 233238, 5556725, 158931613, 5350854707, 208746406117, 9315261027289, 470405726166241, 26636882237942128, 1678097862705130667, 116818375064650241036, 8932347052564257212796 (list; graph; listen)
OFFSET

0,3

REFERENCES

G. Labelle, Counting enriched multigraphs..., Discrete Math., 217 (2000), 237-248.

G. Paquin, D\'enombrement de multigraphes enrichis, M\'emoire, Math. Dept., Univ. Qu\'ebec \`a Montr\'eal, 2004.

LINKS

P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.

FORMULA

E.g.f.: exp(-1+x/2)*Sum((1+x)^binomial(n, 2)/n!, n=0..infinity) [probably in the Labelle paper] - Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 27 2004

E.g.f.: exp(x/2)*Sum(A020556(n)*(ln(1+x)/2)^n/n!, n=0..infinity). - Vladeta Jovovic (vladeta(AT)eunet.rs), May 02 2004

CROSSREFS

Cf. A020554, A020555, A014501.

Sequence in context: A121417 A167016 A108522 this_sequence A101482 A099717 A121879

Adjacent sequences: A014497 A014498 A014499 this_sequence A014501 A014502 A014503

KEYWORD

nonn

AUTHOR

Simon Plouffe, gilbert(AT)lacim.uqam.ca (Gilbert Labelle).

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research