login
a(0) = 10; for n>0, a(n) = n*a(n-1)-n-2.
1

%I #14 Sep 08 2022 08:45:05

%S 10,7,10,25,94,463,2770,19381,155038,1395331,13953298,153486265,

%T 1841835166,23943857143,335213999986,5028209999773,80451359996350,

%U 1367673119937931,24618116158882738,467744207018772001,9354884140375439998,196452566947884239935,4321956472853453278546

%N a(0) = 10; for n>0, a(n) = n*a(n-1)-n-2.

%D From a quiz.

%H G. C. Greubel, <a href="/A068444/b068444.txt">Table of n, a(n) for n = 0..448</a>

%t RecurrenceTable[{a[0]==10,a[n]==n*a[n-1]-n-2},a,{n,20}] (* _Harvey P. Dale_, Oct 20 2015 *)

%o (PARI) s=10; for(n=1,30,s=n*s-n-2; print1(s,","); );

%o (Magma) I:=[7]; [10] cat [n le 1 select I[n] else n*Self(n-1)-n-2: n in [1..30]]; // _G. C. Greubel_, Mar 11 2018

%K nonn,easy

%O 0,1

%A Nancy Zhang, Feb 24 2002

%E More terms from _Benoit Cloitre_, Mar 10 2002

%E Terms a(20) onward added by _G. C. Greubel_, Mar 11 2018