Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098638
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098638 Consider the family of multigraphs enriched by the species of odd sets. Sequence gives number of those multigraphs with n loops and arcs. +0
1
1, 2, 13, 164, 3127, 82600, 2845775, 122820136, 6446913953, 402413160952, 29343933156485, 235446319553848087 (list; graph; listen)
OFFSET

0,2

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((1+sinh(x))^(n^2)/n!,n = 0 .. infinity). - Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 04 2008

CROSSREFS

Sequence in context: A062593 A014507 A132614 this_sequence A090643 A132521 A078363

Adjacent sequences: A098635 A098636 A098637 this_sequence A098639 A098640 A098641

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Oct 26 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research