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!)
A110384 a(1) = 1; a(n+1) = a(n)*(a(n) + n). 0
1, 2, 8, 88, 8096, 65585696, 4301483913318592, 18502763856538658405109886092608, 342352270330833327273885765082712290623512199361069533040982528 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) ~ c^(2^n), where c = 1.32476133150649295684153231492231865907402550177962959967618... . - Vaclav Kotesovec, Jan 19 2015
MAPLE
a[1]:=1: for n from 1 to 10 do a[n+1]:=a[n]*(a[n]+n) od: seq(a[n], n=1..10); # Emeric Deutsch, Jul 31 2005
MATHEMATICA
s=1; lst={}; Do[s*=n+s; AppendTo[lst, s], {n, 0, 3!, 1}]; lst (* Vladimir Joseph Stephan Orlovsky, Nov 10 2008 *)
RecurrenceTable[{a[1]==1, a[n]==a[n-1](a[n-1]+n-1)}, a[n], {n, 10}] (* Harvey P. Dale, May 04 2011 *)
CROSSREFS
Sequence in context: A012299 A012295 A009486 * A153887 A131349 A319124
KEYWORD
easy,nonn
AUTHOR
Amarnath Murthy, Jul 25 2005
EXTENSIONS
Corrected and extended by Emeric Deutsch, Jul 31 2005
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 April 24 14:54 EDT 2024. Contains 371960 sequences. (Running on oeis4.)