The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068444 a(0) = 10; for n>0, a(n) = n*a(n-1)-n-2. 1
 10, 7, 10, 25, 94, 463, 2770, 19381, 155038, 1395331, 13953298, 153486265, 1841835166, 23943857143, 335213999986, 5028209999773, 80451359996350, 1367673119937931, 24618116158882738, 467744207018772001, 9354884140375439998, 196452566947884239935, 4321956472853453278546 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 REFERENCES From a quiz. LINKS G. C. Greubel, Table of n, a(n) for n = 0..448 MATHEMATICA RecurrenceTable[{a[0]==10, a[n]==n*a[n-1]-n-2}, a, {n, 20}] (* Harvey P. Dale, Oct 20 2015 *) PROG (PARI) s=10; for(n=1, 30, s=n*s-n-2; print1(s, ", "); ); (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 CROSSREFS Sequence in context: A098592 A016731 A324087 * A210285 A190996 A210283 Adjacent sequences:  A068441 A068442 A068443 * A068445 A068446 A068447 KEYWORD nonn,easy AUTHOR Nancy Zhang, Feb 24 2002 EXTENSIONS More terms from Benoit Cloitre, Mar 10 2002 Terms a(20) onward added by G. C. Greubel, Mar 11 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 15 01:28 EDT 2020. Contains 336484 sequences. (Running on oeis4.)