|
%I #42 Nov 04 2023 06:29:41
%S 1,2,5,16,53,206,817,3620,16361,80218,401501,2139512,11641885,
%T 66599846,388962953,2367284236,14700573137,94523836850,619674301621,
%U 4186249123808,28809504493061,203556335785342,1463877667140065,10777146970619636,80686484464418233
%N a(n) = Sum_{k=0..n} binomial(n, k) * k! / floor(k/2)!.
%C Binomial transform of { n!/floor(n/2)! }.
%C Number of symmetric chord diagrams of degree n-1.
%C Row sums of exponential Riordan array [(1+x), x(1+x)]. - _Paul Barry_, Apr 17 2007
%H N. J. A. Sloane, <a href="/A018191/b018191.txt">Table of n, a(n) for n = 0..300</a> (first 200 terms from _Vincenzo Librandi_)
%H Guo-Niu Han, <a href="https://arxiv.org/abs/2006.14070">Enumeration of Standard Puzzles</a>, arXiv:2006.14070 [math.CO], 2020.
%H Guo-Niu Han, <a href="/A196265/a196265.pdf">Enumeration of Standard Puzzles</a>. [Cached copy]
%H Alexander Stoimenow, <a href="https://doi.org/10.1016/S0012-365X(99)00347-7">On the number of chord diagrams</a>, Discr. Math. 218 (2000), 209-233.
%F a(n) = A047974(n-1) + (n-1)*A047974(n-2). - _Vladeta Jovovic_, Aug 06 2006
%F E.g.f.: (1 + x)*exp(x + x^2). - _Vladeta Jovovic_, Aug 06 2006
%F Recurrence: (n-2)*a(n) = (n-3)*a(n-1) + 2*(n-1)^2*a(n-2). - _Vaclav Kotesovec_, Oct 13 2012
%F a(n) ~ 2^(n/2 - 1)*exp(sqrt(n/2) - n/2 - 1/8)*n^(n/2 + 1/2)*(1 + 85/96*sqrt(2)/sqrt(n)). - _Vaclav Kotesovec_, Oct 13 2012
%p f:=n-> add(binomial(n,k)*k!/floor(k/2)!, k=0..n); [seq(f(n),n=1..40)]; # _N. J. A. Sloane_, Sep 25 2021
%t a[n_] := Sum[Binomial[n-1, k] k! / Floor[k/2]!, {k, 0, n}];
%t Array[a, 25] (* _Jean-François Alcover_, Aug 29 2019 *)
%t Table[n!*SeriesCoefficient[(1+x)*E^(x+x^2),{x,0,n}],{n,0,20}] (* _Vaclav Kotesovec_, Oct 13 2012 *)
%Y Cf. A047974, A081125.
%K nonn
%O 0,2
%A Alexander Stoimenow (stoimeno(AT)math.toronto.edu)
%E Entry revised by _N. J. A. Sloane_, Sep 25 2021
|
