Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Sep 15 2024 06:51:27
%S 1,2,1,10,7,94,59,1246,833,21602,14105,460250,305095,11656190,7689955,
%T 341753230,226403905,11388911170,7540044785,425080891690,281820040775,
%U 17566875749150,11648654892875,796239842748350,528320780212225
%N a(n) = if n even then a(n - 1) - (n - 1)*a(n - 2) otherwise 2*(a(n - 1) + (n - 1)*a(n - 2)).
%t a[0] = 1; a[1] = 2; a[n_] := a[n] = If[Mod[n, 2] == 0, a[n - 1] - (n - 1)*a[n - 2], 2*(a[n - 1] + (n - 1)*a[n - 2])] b = Table[a[n], {n, 0, 30}]
%t nxt[{n_,a_,b_}]:={n+1,b,If[OddQ[n],b-n*a,2(b+n*a)]}; NestList[nxt,{1,1,2},30][[All,2]] (* _Harvey P. Dale_, Jun 12 2020 *)
%Y Cf. A000898, A121966.
%K nonn,easy
%O 0,2
%A _Roger L. Bagula_, Sep 11 2006
%E Edited by _N. J. A. Sloane_, Sep 13 2006
%E Offset corrected by _Jason Yuen_, Sep 15 2024