cp's OEIS Frontend

A186638 a(0)=a(1)=a(2)=0; thereafter a(n) = n*a(n-1) + n*a(n-2)/(n-2) + (-1)^(n-1)*4/(n-2).

%I A186638 #22 Mar 17 2023 09:55:38
%S A186638 0,0,0,4,14,78,488,3526,28858,264256,2678632,29787932,360669542,
%T A186638 4723907966,66555492656,1003783052878,16136592266226,275459689319104,
%U A186638 4976428074043376,94860000118416084,1902729366895036542,40062161968084543054,883460565601444487384,20363470614798268185558,489687069917632739530538,12264310955130816605856448
%N A186638 a(0)=a(1)=a(2)=0; thereafter a(n) = n*a(n-1) + n*a(n-2)/(n-2) + (-1)^(n-1)*4/(n-2).
%C A186638 Muir gives this recurrence without specifying the initial values.
%C A186638 In general, for the same recurrence a(n) = n*a(n-1) + n*a(n-2)/(n-2) + (-1)^(n-1)*4/(n-2), with a(1)=0, a(2)=0, a(3)=m, is a(n) ~ c * n!, where c = exp(-2) + (BesselI(0,2)-BesselI(1,2))*(m-1)/3. Set m=4 for this sequence and m=1 for A000179. - _Vaclav Kotesovec_, May 05 2015
%D A186638 T. Muir, A Treatise on the Theory of Determinants. Dover, NY, 1960, Sect. 132, p. 112.
%H A186638 Vincenzo Librandi, <a href="/A186638/b186638.txt">Table of n, a(n) for n = 0..69</a>
%F A186638 Recurrence (for n>2): (n-2)*a(n) = (n^2 - 3*n + 3)*a(n-1) + (n^2 - 3*n + 3)*a(n-2) + (n-1)*a(n-3). - _Vaclav Kotesovec_, May 05 2015
%F A186638 a(n) ~ c * n!, where c = exp(-2) + BesselI(0,2) - BesselI(1,2) = 0.8242837309353508959489495107843515087389944891994982884067... . - _Vaclav Kotesovec_, May 05 2015
%p A186638 W:=proc(n) option remember; if n <= 2 then 0 else
%p A186638 n*W(n-1)+n*W(n-2)/(n-2)+(-1)^(n-1)*4/(n-2); fi; end;
%t A186638 Flatten[{0,0,RecurrenceTable[{a[2]==0,a[3]==4,a[n]==n*a[n-1]+n*a[n-2]/(n-2)+(-1)^(n-1)*4/(n-2)},a,{n,2,20}]}] (* _Vaclav Kotesovec_, May 05 2015 *)
%o A186638 (Maxima) a[0]:0$ a[1]:0$ a[2]:0$ a[n]:=n*a[n-1]+n*a[n-2]/(n-2)+4*(-1)^(n-1)/(n-2)$ makelist(a[n], n, 0, 25); /* _Bruno Berselli_, May 23 2011 */
%Y A186638 A000179 satisfies essentially the same recurrence.
%K A186638 nonn
%O A186638 0,4
%A A186638 _N. J. A. Sloane_, Feb 24 2011