The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A145386 a(1) = 1; a(n) = a(n-1)*(2*(n-1)+a(n-1)) for n > 1. 0
 1, 3, 21, 567, 326025, 106295560875, 11298746263006377496125, 127661667115800580590177504581888913674961375 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Next term has 89 decimal digits and is too large to include. - Klaus Brockhaus, Oct 13 2008 LINKS FORMULA a(n) = Product_{k = 1..n} b(k), where b(1) = 1 and b(n) = a(n-1) + 2*(n-1) for n > 1. The sequence b(n) begins [1, 3, 7, 27, 575, 326035, ...] and is given by the recurrence b(n) = b(n-1)^2 - 2*(n-2)*b(n-1) + 2*(n-1) with b(1) = 1. - Peter Bala, Mar 27 2018 EXAMPLE a(2) = a(1)*(2*(2-1)+a(1)) = 1*(2*1+1) = 3. - Klaus Brockhaus, Oct 13 2008 MATHEMATICA lst={}; s=1; Do[s*=(n+=s+n); AppendTo[lst, s], {n, 0, 7}]; lst PROG (ARIBAS) a:=1; for n:=1 to 9 do a:=a*(a+2*(n-1)); write(a:group(0), ", "); end; end; (* Klaus Brockhaus, Oct 13 2008 *) (PARI) a=vector(15); a[1]=1; for(n=2, #a, a[n] = a[n-1]*(2*(n-1)+a[n-1])); a \\ Altug Alkan, Mar 27 2018 CROSSREFS Sequence in context: A006927 A014375 A135748 * A135327 A128679 A292331 Adjacent sequences:  A145383 A145384 A145385 * A145387 A145388 A145389 KEYWORD nonn,easy AUTHOR Vladimir Joseph Stephan Orlovsky, Oct 10 20 EXTENSIONS Name edited by Klaus Brockhaus, Oct 13 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 12 05:30 EDT 2021. Contains 343812 sequences. (Running on oeis4.)