login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098343 Consider the family of multigraphs enriched by the species of binary arborescences. Sequence gives number of those multigraphs with n edges and loops. 0
1, 2, 15, 187, 3283, 74825, 2109272, 71217488, 2815154006, 128079232835, 6618682431711, 384397221347345 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

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.

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: A319834 A268420 A208402 * A052819 A349292 A328121

Adjacent sequences:  A098340 A098341 A098342 * A098344 A098345 A098346

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 29 01:05 EDT 2022. Contains 357082 sequences. (Running on oeis4.)