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!)
A051893 a(n) = Sum_{i=1..n-1} i^2*a(i), a(1) = 1. 3
1, 1, 5, 50, 850, 22100, 817700, 40885000, 2657525000, 217917050000, 22009622050000, 2685173890100000, 389350214064500000, 66189536390965000000, 13039338669020105000000, 2946890539198543730000000, 757350868574025738610000000, 219631751886467464196900000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = Product_{i=2..n-1} (i^2+1), for n>2. - Vladeta Jovovic, Nov 26 2002
From Vaclav Kotesovec, Mar 13 2015: (Start)
For n > 1, a(n) = A101686(n-1)/2.
a(n) ~ (n-1)!^2 * sinh(Pi)/(2*Pi).
(End)
a(n) = (A003703(n)^2 + A009454(n)^2 + A000007(n-1))/2. - Vladimir Reshetnikov, Oct 15 2016
a(n) = sinh(Pi)*Gamma(n-I)*Gamma(n+I)/(2*Pi) for n>1. - Peter Luschny, Oct 19 2016
MAPLE
a := n -> `if`(n=1, 1, (sinh(Pi)*GAMMA(n-I)*GAMMA(n+I))/(2*Pi)):
seq(simplify(a(n)), n=1..18); # Peter Luschny, Oct 19 2016
MATHEMATICA
a[n_] := Pochhammer[2-I, n-2]*Pochhammer[2+I, n-2]; a[1] = 1; Table[a[n], {n, 1, 15}] (* Jean-François Alcover, Dec 21 2012, after Vladeta Jovovic *)
Join[{1}, FoldList[Times, 1, Range[2, 20]^2+1]] (* Harvey P. Dale, Jul 04 2013 *)
Clear[a]; a[1]=1; a[n_]:=a[n]=Sum[i^2*a[i], {i, 1, n-1}]; Table[a[n], {n, 1, 20}] (* Vaclav Kotesovec, Mar 13 2015 *)
CROSSREFS
Sequence in context: A088992 A320502 A116906 * A354685 A247951 A082100
KEYWORD
nice,nonn
AUTHOR
Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 17 1999
EXTENSIONS
More terms from Harvey P. Dale, Jul 04 2013
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 28 18:07 EDT 2024. Contains 372092 sequences. (Running on oeis4.)