This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A117643 a(n)=n*(a(n-1)-1) starting with a(0)=3. 0
 3, 2, 2, 3, 8, 35, 204, 1421, 11360, 102231, 1022300, 11245289, 134943456, 1754264915, 24559708796, 368395631925, 5894330110784, 100203611883311, 1803665013899580, 34269635264092001, 685392705281840000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Starting with a(0)=0 would give -A007526(n); starting with a(0)=1 would give -A038156(n). In general for this recurrence a(n) = ceiling[1 + n!*(a(0)-e)] for n>0; this is the first case with positive terms. LINKS FORMULA a(n) = ceiling[1 + n!*(3-e)] for n>0. a(n)=3*n!-Sum{k=0..n}{k/k!}*n!, with n>=0 [From Paolo P. Lava, Oct 07 2008] a(n) = n! -floor(e*n!) + 1,n>0 [From Gary Detlefs, Jun 06 2010] EXAMPLE a(5) = 5*(a(4)-1) = 5*(8-1) = 35. MATHEMATICA a=3; Table[a=a*n-n, {n, 1, 2*4!}] [From Vladimir Joseph Stephan Orlovsky, Apr 22 2010] CROSSREFS Sequence in context: A059942 A032450 A046460 * A164522 A141862 A106267 Adjacent sequences:  A117640 A117641 A117642 * A117644 A117645 A117646 KEYWORD easy,nonn AUTHOR Henry Bottomley, Apr 10 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .