login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098625 Consider the family of multigraphs enriched by the species of derangements. Sequence gives number of those multigraphs with n loops and edges. 3
1, 0, 2, 4, 39, 228, 2400, 23616, 307692, 4197408, 67658769, 1174316570, 22916090131, 482946085932 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

REFERENCES

G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004.

LINKS

Table of n, a(n) for n=0..13.

G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004. [Cached copy, with permission]

CROSSREFS

Sequence in context: A009834 A106127 A018992 * A057777 A139735 A184952

Adjacent sequences:  A098622 A098623 A098624 * A098626 A098627 A098628

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Oct 26 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 26 23:42 EDT 2021. Contains 347673 sequences. (Running on oeis4.)