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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053817 a(0)=1, a(n) = n*(a(n-1) + n). 0

%I

%S 1,2,8,33,148,765,4626,32431,259512,2335689,23356990,256927011,

%T 3083124276,40080615757,561128620794,8416929312135,134670868994416,

%U 2289404772905361,41209285912296822,782976432333639979

%N a(0)=1, a(n) = n*(a(n-1) + n).

%F a(n) = A030297(n) + n! = A019460(2n+1) - n. - _Henry Bottomley_, Nov 10 2000

%F a(n)= n! + floor(2*e*n!-n) - 2, n>1. - _Gary Detlefs_, Jun 22 2010

%e Start with 1, add 1, multiply by 1 (getting 2), add 2, multiply by 2 (getting 8).

%t a=1;lst={a};Do[a=(a+n)*n;AppendTo[lst, a], {n, 2*4!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Dec 14 2008 *)

%t RecurrenceTable[{a[0]==1,a[n]==n(a[n-1]+n)},a,{n,20}] (* _Harvey P. Dale_, Feb 14 2015 *)

%K nonn,easy,nice

%O 0,2

%A mindy and steve schwartz (minsteve(AT)netvision.net.il), Apr 07 2000

%E More terms from _James A. Sellers_, Apr 08 2000

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 2 23:29 EST 2016. Contains 278694 sequences.