Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020563
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A020563 Number of cyclic multigraphs on n labeled edges (with loops). +0
1
1, 2, 9, 68, 750, 11178, 213895, 5068102, 144746329, 4880572564, 191104219619, 8573780527428, 435844228476008, 24868815362420244, 1579939008182007447, 110981916769308996238, 8567134375799509782211 (list; graph; listen)
OFFSET

0,2

REFERENCES

G. Labelle, Counting enriched multigraphs..., Discrete Math., 217 (2000), 237-248.

G. Paquin, D\'enombrement de multigraphes enrichis, M\'emoire, Math. Dept., Univ. Qu\'ebec \`a Montr\'eal, 2004.

CROSSREFS

Sequence in context: A038037 A138212 A120980 this_sequence A006849 A121417 A136738

Adjacent sequences: A020560 A020561 A020562 this_sequence A020564 A020565 A020566

KEYWORD

nonn

AUTHOR

Gilbert Labelle (gilbert(AT)lacim.uqam.ca), Simon Plouffe (plouffe(AT)math.uqam.ca)

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research