login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098622 Consider the family of multigraphs enriched by the species of partitions. Sequence gives number of those multigraphs with n loops and arcs. 1
1, 2, 17, 250, 5465, 162677, 6241059, 297132409, 17075153860, 1159545515804, 91501467848088, 8276847825732141, 848577193578286942, 97672164219292005480, 12518933902769241287267, 1774279753092963892540493 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Alternatively, consider the family of multigraphs enriched by the species of involutions. Sequence also gives number of those multigraphs with n loops and arcs.

REFERENCES

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

FORMULA

E.g.f.: exp(-1)*Sum(exp(n^2*(exp(x)-1))/n!,n=0..infinity). - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 24 2006

a(n) = Sum_{k=0..n} Stirling2(n,k)*Bell(2*k). - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 24 2006

CROSSREFS

Sequence in context: A036082 A099694 A099698 * A020561 A099702 A029735

Adjacent sequences:  A098619 A098620 A098621 * A098623 A098624 A098625

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Oct 26 2004

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 24 2006

Edited by N. J. A. Sloane (njas(AT)research.att.com) at the suggestion of Andrew Plewe, Jun 15 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:30 EST 2012. Contains 205907 sequences.