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!)
A052111 Number of self-complementary 2-multigraphs with loops on n nodes. 2
1, 2, 5, 24, 120, 956, 13214, 275848, 10613479, 601955190, 63788179593, 9985272721908, 2906903866536978, 1268802939666164781, 1023198355173637429689, 1258181815243248217067175, 2834890911778762731361375215, 9900896274205100008273760895560 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A 2-multigraph is similar to an ordinary graph except there are 0, 1 or 2 edges between any two nodes (self-loops are not allowed).
LINKS
PROG
(PARI)
permcount(v) = {my(m=1, s=0, k=0, t); for(i=1, #v, t=v[i]; k=if(i>1&&t==v[i-1], k+1, 1); m*=t*k; s+=t); s!/m}
edges(v) = {sum(i=2, #v, sum(j=1, i-1, if(v[i]*v[j]%2==0, gcd(v[i], v[j])))) + sum(i=1, #v, if(v[i]%2==0, v[i]\4*2+1))}
a(n) = {my(s=0); forpart(p=n, s+=permcount(p)*3^edges(p)); s/n!} \\ Andrew Howroyd, Sep 16 2018
CROSSREFS
Sequence in context: A322897 A284230 A364229 * A176473 A185056 A346204
KEYWORD
nonn
AUTHOR
Vladeta Jovovic, Jan 21 2000
EXTENSIONS
Terms a(17) and beyond from Andrew Howroyd, Sep 16 2018
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 March 19 06:05 EDT 2024. Contains 370952 sequences. (Running on oeis4.)