A039717 Row sums of convolution triangle A030523.
1, 4, 15, 55, 200, 725, 2625, 9500, 34375, 124375, 450000, 1628125, 5890625, 21312500, 77109375, 278984375, 1009375000, 3651953125, 13212890625, 47804687500, 172958984375, 625771484375, 2264062500000, 8191455078125
Offset: 1
Links
- Michel Marcus, Table of n, a(n) for n = 1..1000
- Wolfdieter Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.
- Index entries for linear recurrences with constant coefficients, signature (5,-5).
Programs
-
Mathematica
CoefficientList[Series[(1 - x) / (1 - 5 x + 5 x^2), {x, 0, 40}], x] (* Vincenzo Librandi, Nov 10 2014 *)
-
PARI
Vec(x*(1-x)/(1-5*x+5*x^2) + O(x^40)) \\ Altug Alkan, Nov 20 2015
Formula
G.f.: x*(1-x)/(1-5*x+5*x^2) = g1(3, x)/(1-g1(3, x)), g1(3, x) := x*(1-x)/(1-2*x)^2 (g.f. first column of A030523).
From Paul Barry, Apr 16 2004: (Start)
Binomial transform of Fibonacci(2n+2).
a(n) = (sqrt(5)/2 + 5/2)^n*(3*sqrt(5)/10 + 1/2) - (5/2 - sqrt(5)/2)^n*(3*sqrt(5)/10 - 1/2). (End)
a(n) = (1/5)*Sum_{r=1..9} sin(3*r*Pi/10)*sin(r*Pi/2)*(2*cos(r*Pi/10))^(2*n).
a(n) = 5*a(n-1) - 5*a(n-2).
a(n) = Sum_{k=0..n} Sum_{i=0..n} binomial(n, i)*binomial(k+i+1, 2k+1). - Paul Barry, Jun 22 2004
From Johannes W. Meijer, Jul 01 2010: (Start)
(End)
From Benito van der Zander, Nov 19 2015: (Start)
Limit_{k->oo} a(k+1)/a(k) = 1 + phi^2 = (5 + sqrt(5)) / 2.
a(n) = a(n-1) * 3 + A081567(n-2) (not proved).
(End)
E.g.f.: exp(x*5/2) * (cosh(x*sqrt(5)/2) + (3/sqrt(5))*sinh(x*sqrt(5)/2)). - Fabian Pereyra, Oct 29 2024
Comments