login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A166680 a(n) = n*(a(n-1)-4), a(0) = 1. 1
1, -3, -14, -54, -232, -1180, -7104, -49756, -398080, -3582756, -35827600, -394103644, -4729243776, -61480169140, -860722368016, -12910835520300, -206573368324864, -3511747261522756, -63211450707409680 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..200

FORMULA

a(n) = n! - 4*floor(e*n!) + 4, n>0. - Gary Detlefs, Jun 19 2010

MATHEMATICA

RecurrenceTable[{a[0]==1, a[n]==n(a[n-1]-4)}, a, {n, 20}] (* Harvey P. Dale, Apr 18 2014 *)

FoldList[#1*#2 - 4 #2 &, 1, Range[50]] (* G. C. Greubel, May 23 2016 *)

CROSSREFS

Cf. A000142, A166554, A165793, A165814.

Sequence in context: A083424 A099487 A179610 * A104191 A151540 A226466

Adjacent sequences:  A166677 A166678 A166679 * A166681 A166682 A166683

KEYWORD

easy,sign

AUTHOR

Philippe Deléham, Oct 18 2009

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 12 01:08 EST 2017. Contains 295936 sequences.