The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053817 a(0)=1, a(n) = n*(a(n-1) + n). 3
1, 2, 8, 33, 148, 765, 4626, 32431, 259512, 2335689, 23356990, 256927011, 3083124276, 40080615757, 561128620794, 8416929312135, 134670868994416, 2289404772905361, 41209285912296822, 782976432333639979, 15659528646672799980, 328850101580128800021 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = A030297(n) + n! = A019460(2n+1) - n. - Henry Bottomley, Nov 10 2000
a(n)= n! + floor(2*e*n!-n) - 2, n>1. - Gary Detlefs, Jun 22 2010
E.g.f.: (1 + x * (1 + x) * exp(x)) / (1 - x). - Ilya Gutkovskiy, Oct 11 2021
EXAMPLE
Start with 1, add 1, multiply by 1 (getting 2), add 2, multiply by 2 (getting 8).
MAPLE
a:= proc(n) a(n):= n*(a(n-1) + n) end: a(0):= 1:
seq(a(n), n=0..23); # Alois P. Heinz, May 12 2021
MATHEMATICA
a=1; lst={a}; Do[a=(a+n)*n; AppendTo[lst, a], {n, 2*4!}]; lst (* Vladimir Joseph Stephan Orlovsky, Dec 14 2008 *)
RecurrenceTable[{a[0]==1, a[n]==n(a[n-1]+n)}, a, {n, 20}] (* Harvey P. Dale, Feb 14 2015 *)
CROSSREFS
Sequence in context: A150879 A150880 A150881 * A150882 A150883 A150884
KEYWORD
nonn,easy,nice
AUTHOR
mindy and steve schwartz (minsteve(AT)netvision.net.il), Apr 07 2000
EXTENSIONS
More terms from James A. Sellers, Apr 08 2000
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 20 08:57 EDT 2024. Contains 372710 sequences. (Running on oeis4.)