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!)
A259903 n*a(n+1) = (2*n^2+3*n-1)*a(n)-(n^2-n-2)*a(n-1); a(0)=1, a(1)=3. 0

%I #10 Jul 09 2015 10:27:29

%S 1,3,14,91,770,8050,100268,1449742,23865548,440676460,9019620680,

%T 202671360724,4959803073176,131305759645144,3739011996408080,

%U 113954082693469480,3701040157021402832,127610023505869902928,4655283171722971780832,179142225346223264881840

%N n*a(n+1) = (2*n^2+3*n-1)*a(n)-(n^2-n-2)*a(n-1); a(0)=1, a(1)=3.

%F a(n) ~ 7 * exp(1/4) * 2^(n+3) * n! * n^(1/4) / (15*Gamma(1/4)). - _Vaclav Kotesovec_, Jul 09 2015

%t RecurrenceTable[{a[0]==1, a[1]==3, (n)*a[n+1]== (2n^2 +3*n-1)*a[n] - (n+1)*(n-2)*a[n-1]}, a, {n, 30}]

%K nonn,easy

%O 0,2

%A _G. C. Greubel_, Jul 07 2015

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 03:08 EDT 2024. Contains 371918 sequences. (Running on oeis4.)