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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A046033 a(n) = (n!)^3 - 1. 1
 0, 7, 215, 13823, 1727999, 373247999, 128024063999, 65548320767999, 47784725839871999, 47784725839871999999, 63601470092869631999999, 109903340320478724095999999, 241457638684091756838911999999 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..100 Eric Weisstein's World of Mathematics, Factorial FORMULA From Robert Israel, Feb 05 2018: (Start) a(n+1)+1 = (a(n)+1)*(n+1)^3. -(n^2+5*n+7)*(n+1)^4*a(n)+(n^2+3*n+1)*(n^4+6*n^3+14*n^2+15*n+7)*a(n+1)-n*(n^2+3*n+3)*a(n+2) = 0. (End) MAPLE seq((n!)^3-1, n=1..20); # Robert Israel, Feb 05 2018 MATHEMATICA (Range[20]!)^3-1 (* Harvey P. Dale, Mar 24 2014 *) PROG (Magma) [Factorial(n)^3-1: n in [1..15]]; // Vincenzo Librandi, Mar 25 2014 CROSSREFS Cf. A019514. Sequence in context: A061028 A012862 A045760 * A193836 A193877 A193186 Adjacent sequences:  A046030 A046031 A046032 * A046034 A046035 A046036 KEYWORD nonn,easy AUTHOR STATUS approved

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.

Last modified November 26 09:42 EST 2022. Contains 358354 sequences. (Running on oeis4.)