cp's OEIS Frontend

A328141 a(n) = a(n-1) - (n-2)*a(n-2), with a(0)=1, a(1)=2.

%I A328141 #17 Sep 08 2022 08:46:24
%S A328141 1,2,2,0,-4,-4,12,32,-40,-264,56,2432,1872,-24880,-47344,276096,
%T A328141 938912,-3202528,-18225120,36217856,364270016,-323869248,-7609269568,
%U A328141 -808015360,166595915136,185180268416,-3813121694848,-8442628405248,90698535660800,318649502602496,-2220909495899904
%N A328141 a(n) = a(n-1) - (n-2)*a(n-2), with a(0)=1, a(1)=2.
%C A328141 Former title and formula of A122033, but not the data.
%H A328141 G. C. Greubel, <a href="/A328141/b328141.txt">Table of n, a(n) for n = 0..800</a>
%F A328141 a(n) = a(n-1) - (n-2)*a(n-2), with a(0)=1, a(1)=2.
%F A328141 E.g.f.: 1 + sqrt(2*e*Pi)*( erf(1/sqrt(2)) + erf((x-1)/sqrt(2)) ), where erf(x) is the error function.
%F A328141 a(n) = 2*(-1)^(n-1)*A001464(n-1).
%F A328141 a(n) = 2*(1/sqrt(2))^(n-1) * Hermite(n-1, 1/sqrt(2)), n > 0.
%p A328141 a:= proc (n) option remember;
%p A328141 if n < 2 then n+1
%p A328141 else a(n-1) - (n-2)*a(n-2)
%p A328141 fi;
%p A328141 end proc; seq(a(n), n = 0..35);
%t A328141 a[n_]:= a[n]= If[n<2, n+1, a[n-1]-(n-2)*a[n-2]]; Table[a[n], {n,0,35}]
%o A328141 (PARI) my(m=35, v=concat([1,2], vector(m-2))); for(n=3, m, v[n] = v[n-1] - (n-3)*v[n-2] ); v
%o A328141 (Magma) I:=[1,2]; [n le 2 select I[n] else Self(n-1) - (n-3)*Self(n-2): n in [1..35]];
%o A328141 (Sage)
%o A328141 def a(n):
%o A328141     if n<2: return n+1
%o A328141     else: return a(n-1) - (n-2)*a(n-2)
%o A328141 [a(n) for n in (0..35)]
%o A328141 (GAP) a:=[1,2];; for n in [3..35] do a[n]:=a[n-1]-(n-3)*a[n-2]; od; a;
%Y A328141 Cf. A001464, A060821, A121966, A122033.
%K A328141 sign
%O A328141 0,2
%A A328141 _G. C. Greubel_, Oct 04 2019