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!)
A165793 a(0)=1, a(n)=n*(a(n-1)-2). 3

%I #13 Apr 08 2016 19:53:16

%S 1,-1,-6,-24,-104,-530,-3192,-22358,-178880,-1609938,-16099400,

%T -177093422,-2125121088,-27626574170,-386772038408,-5801580576150,

%U -92825289218432,-1578029916713378,-28404538500840840

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

%H G. C. Greubel, <a href="/A165793/b165793.txt">Table of n, a(n) for n = 0..250</a>

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

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

%t FoldList[#1*#2 - 2 #2 &, 1, Range[25]] (* _G. C. Greubel_, Apr 08 2016 *)

%K sign

%O 0,3

%A _Philippe Deléham_, Sep 26 2009

%E Corrected by _Harvey P. Dale_, Jul 19 2011

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 July 26 18:12 EDT 2024. Contains 374636 sequences. (Running on oeis4.)