Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098625
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098625 Consider the family of multigraphs enriched by the species of derangements. Sequence gives number of those multigraphs with n loops and edges. +0
1
1, 0, 2, 4, 39, 228, 2400, 23616, 307692, 4197408, 67658769, 1174316570, 22916090131, 482946085932 (list; graph; listen)
OFFSET

0,3

REFERENCES

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

CROSSREFS

Sequence in context: A009835 A009834 A018992 this_sequence A057777 A139735 A098337

Adjacent sequences: A098622 A098623 A098624 this_sequence A098626 A098627 A098628

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 December 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research