A117643 - OEIS

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A117643

a(n) = n*(a(n-1)-1) starting with a(0)=3.

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

Table of n, a(n) for n=0..20.

FORMULA

a(n) = ceiling(1 + n!*(3-e)) for n>0.

a(n) = n! - floor(e*n!) + 1, n>0. - 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!}] (* Vladimir Joseph Stephan Orlovsky, Apr 22 2010 *)

RecurrenceTable[{a[0]==3, a[n]==n(a[n-1]-1)}, a, {n, 20}] (* Harvey P. Dale, Jul 17 2018 *)

CROSSREFS

Sequence in context: A376274 A046460 A327661 * A141862 A237612 A362465

Adjacent sequences: A117640 A117641 A117642 * A117644 A117645 A117646

KEYWORD

easy,nonn

AUTHOR

Henry Bottomley, Apr 10 2006

STATUS

approved