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!)
A020562 Number of cyclic multigraphs on n labeled edges (without loops). 0
1, 1, 3, 17, 152, 1933, 32608, 695657, 18148533, 564860131, 20581455139, 864802010595, 41392831046804, 2233799248861031, 134737655762330602, 9015762313899965851, 664889968074287179739 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
G. Paquin, Dénombrement de multigraphes enrichis, Mémoire, Math. Dept., Univ. Québec à Montréal, 2004. [Cached copy, with permission]
FORMULA
a(n) = Sum_{k=0..n} (-1)^(n-k)*Stirling1(n, k)*A014500(k). - Sean A. Irvine, Apr 25 2019
CROSSREFS
Cf. A014500.
Sequence in context: A007767 A075820 A145081 * A193161 A364630 A318987
KEYWORD
nonn
AUTHOR
Gilbert Labelle (gilbert(AT)lacim.uqam.ca), Simon Plouffe
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 August 7 03:18 EDT 2024. Contains 375003 sequences. (Running on oeis4.)