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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099700 Consider the family of multigraphs enriched by the species of simple graphs. Sequence gives number of those multigraphs with n edges. 0
1, 1, 4, 29, 330, 5438, 128211, 4808964, 378829853, 77137284917, 36854103598061, 36864364745783295 (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..11.

CROSSREFS

Sequence in context: A215955 A028853 A118795 * A276728 A256006 A137646

Adjacent sequences:  A099697 A099698 A099699 * A099701 A099702 A099703

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 4 05:11 EST 2016. Contains 278748 sequences.