Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099713
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099713 Consider the family of multigraphs enriched by the species of arborescences. Sequence gives number of those multigraphs with n loops and edges. +0
1
1, 2, 11, 103, 1383, 24505, 545354, 14751666, 473719878, 17740486031, 763890459761, 37384489903461 (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.

CROSSREFS

Sequence in context: A115941 A024721 A081716 this_sequence A111535 A088690 A118805

Adjacent sequences: A099710 A099711 A099712 this_sequence A099714 A099715 A099716

KEYWORD

nonn

AUTHOR

njas, 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 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research