login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A166554 a(0)=1, a(n) = n*(a(n-1)-1) for n>0. 3

%I #14 May 17 2016 16:31:13

%S 1,0,-2,-9,-40,-205,-1236,-8659,-69280,-623529,-6235300,-68588311,

%T -823059744,-10699776685,-149796873604,-2246953104075,-35951249665216,

%U -611171244308689,-11001082397556420,-209020565553571999

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

%H G. C. Greubel, <a href="/A166554/b166554.txt">Table of n, a(n) for n = 0..500</a>

%F a(n) = -A038156(n) for n>0.

%F a(n) = n! - floor(e*n!) + 1, n>0. - _Gary Detlefs_, Jun 06 2010

%F a(n) = (n+2)*a(n-1) - (2*n-1)*a(n-2) + (n-2)*a(n-3). - _R. J. Mathar_, Jul 28 2013

%t RecurrenceTable[{a[0]==1,a[n]==n(a[n-1]-1)},a[n],{n,20}] (* _Harvey P. Dale_, Jul 25 2011 *)

%Y Cf. A000142, A165793, A165814.

%K sign

%O 0,3

%A _Philippe Deléham_, Oct 16 2009

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)