This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A052711 #25 May 30 2022 02:24:09 %S A052711 0,0,0,6,48,600,10080,211680,5322240,155675520,5189184000, %T A052711 194075481600,8045310873600,366061644748800,18134130709094400, %U A052711 971471287987200000,55956746188062720000,3448334483839365120000 %N A052711 Expansion of e.g.f. x*(1 - 2*x - sqrt(1-4*x))/2. %H A052711 G. C. Greubel, <a href="/A052711/b052711.txt">Table of n, a(n) for n = 0..350</a> %H A052711 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=667">Encyclopedia of Combinatorial Structures 667</a> %F A052711 D-finite with recurrence: a(1)=0, a(2)=0, a(3)=6, a(4)=48, n*a(n+1) = 2*(n+1)*(2*n-3)*a(n). %F A052711 From _R. J. Mathar_, Oct 18 2013: (Start) %F A052711 a(n) = n!*A000108(n-2). %F A052711 a(n) = A052717(n), n>2. (End) %F A052711 G.f.: x*(1 - 4*x - 2F0([-1/2,2], [], 4*x))/2. - _R. J. Mathar_, Jan 25 2020 %p A052711 spec := [S,{C=Union(B,Z),B=Prod(C,C),S=Prod(B,Z)},labeled]: seq(combstruct[count](spec,size=n), n=0..20); %t A052711 With[{nn=20},CoefficientList[Series[x (1-2x-Sqrt[1-4x])/2,{x,0,nn}],x] Range[0,nn]!] (* _Harvey P. Dale_, Mar 05 2016 *) %t A052711 Table[n!*CatalanNumber[n-2] +Boole[n==1] -2*Boole[n==2], {n,0,30}] (* _G. C. Greubel_, May 30 2022 *) %o A052711 (SageMath) [factorial(n)*catalan_number(n-2) + bool(n==1)/2 - 2*bool(n==2) for n in (0..30)] # _G. C. Greubel_, May 30 2022 %Y A052711 Cf. A052712, A052713, A052714, A052715, A052716, A052717, A052718, A052719, A052720, A052721, A052722, A052723. %Y A052711 Cf. A000108, A052717. %K A052711 easy,nonn %O A052711 0,4 %A A052711 encyclopedia(AT)pommard.inria.fr, Jan 25 2000