This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A092634 a(n) = 1 - Sum(k*k!), for k = 2..n. 0
 -3, -21, -117, -717, -5037, -40317, -362877, -3628797, -39916797, -479001597, -6227020797, -87178291197, -1307674367997, -20922789887997, -355687428095997, -6402373705727997, -121645100408831997, -2432902008176639997 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS Appeared in University of Texas Interscholastic League High School Number Sense District Test, 2004 LINKS Index entries for linear recurrences with constant coefficients, signature (2, 0, -2, 1). FORMULA a(n) = 1 - Sum(k*k!), for k = 2..n. Conjecture: a(n) +(-n-3)*a(n-1) +(2*n+1)*a(n-2) +(-n+1)*a(n-3)=0. - R. J. Mathar, Sep 27 2014 MATHEMATICA Table[i; 1 - Sum[n n!, {n, 2, i}], {i, 2, 20}] CROSSREFS Cf. A033312. Sequence in context: A183404 A121140 A005057 * A178537 A084159 A046727 Adjacent sequences:  A092631 A092632 A092633 * A092635 A092636 A092637 KEYWORD sign AUTHOR Doug Ray (draymath(AT)iastate.edu), Apr 11 2004 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.