Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099700
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 1, 4, 29, 330, 5438, 128211, 4808964, 378829853, 77137284917, 36854103598061, 36864364745783295 (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: A030019 A028853 A118795 this_sequence A137646 A000798 A135485

Adjacent sequences: A099697 A099698 A099699 this_sequence A099701 A099702 A099703

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