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!)
A025254 a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-3)*a(3) for n >= 4. 1

%I #5 Mar 02 2014 06:11:32

%S 3,1,1,3,10,34,118,417,1497,5448,20063,74649,280252,1060439,4040413,

%T 15488981,59701236,231236830,899559100,3513314664,13770811198,

%U 54152480421,213585706927,844723104691,3349274471386,13310603555085,53012829376985

%N a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-3)*a(3) for n >= 4.

%F G.f.: (1 + 3*x + x^2 - sqrt(x^4 + 2*x^3 + 7*x^2 - 6*x + 1))/(2*x). - _Vaclav Kotesovec_, Mar 02 2014

%F Recurrence: (n+1)*a(n) = 3*(2*n-1)*a(n-1) - 7*(n-2)*a(n-2) - (2*n-7)*a(n-3) - (n-5)*a(n-4). - _Vaclav Kotesovec_, Mar 02 2014

%t CoefficientList[Series[(1+3*x+x^2-Sqrt[x^4+2*x^3+7*x^2-6*x+1])/(2*x),{x,0,20}],x] (* _Vaclav Kotesovec_, Mar 02 2014 *)

%Y Cf. A178578.

%K nonn

%O 1,1

%A _Clark Kimberling_

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 August 26 02:15 EDT 2024. Contains 375454 sequences. (Running on oeis4.)