The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A007474 Number of circular chord diagrams with n chords, up to rotational symmetry. (Formerly M1800) 2

%I M1800

%S 1,0,1,2,7,36,300,3218,42335,644808,11119515,213865382,4537496680,

%T 105270612952,2651295555949,72042968876506,2100886276796969,

%U 65446290562491916,2169090198219290966,76211647261082309466,2829612806029873399561

%N Number of circular chord diagrams with n chords, up to rotational symmetry.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Gheorghe Coserea, <a href="/A007474/b007474.txt">Table of n, a(n) for n = 0..300</a>

%H Dror Bar-Natan, <a href="https://www.math.toronto.edu/drorbn/papers/OnVassiliev/">On the Vassiliev Knot Invariants</a>, Topology 34 (1995) 423-472.

%H D. Bar-Natan, <a href="http://www.pdmi.ras.ru/~duzhin/VasBib/">Bibliography of Vassiliev Invariants</a>

%H E. Krasko, A. Omelchenko, <a href="http://arxiv.org/abs/1601.05073">Enumeration of Chord Diagrams without Loops and Parallel Chords</a>, arXiv preprint arXiv:1601.05073 [math.CO], 2016.

%H E. Krasko, A. Omelchenko, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p43">Enumeration of Chord Diagrams without Loops and Parallel Chords</a>, The Electronic Journal of Combinatorics, 24(3) (2017), #P3.43.

%t m = 20; Clear[M]; M[_, _] = 0; Mget[n_, k_] := Which[n < 0, 0, n == 0, 1, n == 1, 1 - Mod[k, 2], n == 2, k - Mod[k, 2], True, M[n, k]]; Mset[n_, k_, v_] := (M[n, k] = v); Minit[] = (tmp = 0; For[n = 3, n <= 2*m, n++, For[k = 1, k <= 2*m, k++, tmp = If[Mod[k, 2] == 1, k*(n-1)*Mget[n-2, k] + Mget[n-4, k], Mget[n-1, k] + k*(n-1) * Mget[n-2, k] - Mget[n-3, k] + Mget[n-4, k]]; Mset[n, k, tmp]]];); a[n_] := DivisorSum[2*n, EulerPhi[#] * (Mget[2*n/#, #] - Mget[2*n/# - 2, #])&] / (2*n); Minit[]; Prepend[ Array[a, m], 1] (* _Jean-François Alcover_, Apr 24 2017, after _Gheorghe Coserea_ *)

%o (PARI)

%o N = 20; M = matrix(2*N, 2*N);

%o Mget(n,k) = { if (n<0, 0, n==0, 1, n==1, 1-(k%2), n==2, k-(k%2), M[n,k]) };

%o Mset(n,k,v) = { M[n,k] = v;};

%o Minit() = {

%o my(tmp = 0);

%o for (n=3, 2*N, for(k=1, 2*N,

%o tmp = if (k%2, k*(n-1) * Mget(n-2, k) + Mget(n-4, k),

%o Mget(n-1, k) + k*(n-1) * Mget(n-2, k) - Mget(n-3, k) + Mget(n-4, k));

%o Mset(n, k, tmp)));

%o };

%o a(n) = sumdiv(2*n, d, eulerphi(d) * (Mget(2*n/d, d) - Mget(2*n/d-2, d))) / (2*n);

%o Minit();

%o concat(1, vector(N, n, a(n))) \\ _Gheorghe Coserea_, Dec 10 2016

%K nonn,nice

%O 0,4

%A _N. J. A. Sloane_.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 22 04:27 EST 2020. Contains 331133 sequences. (Running on oeis4.)