OFFSET
1,2
COMMENTS
Transform of Fibonacci numbers based on the triangle A030528.
LINKS
Index entries for linear recurrences with constant coefficients, signature (1,2,2,1).
FORMULA
a(n) = sum(Fibonacci(k)*binomial(k,n-k), k=floor((n-1)/2)+1..n).
G.f.: x*(1+x)/(1-x-2*x^2-2*x^3-x^4).
MATHEMATICA
CoefficientList[Series[(1 + x)/(1 - x - 2 x^2 - 2 x^3 - x^4), {x, 0, 30}], x] (* Bruno Berselli, Jan 23 2013 *)
LinearRecurrence[{1, 2, 2, 1}, {1, 2, 4, 10}, 30] (* Harvey P. Dale, Mar 28 2015 *)
PROG
(Magma) [&+[Fibonacci(k)*Binomial(k, n-k): k in [Floor((n-1)/2)+1..n]]: n in [1..30]]; // Bruno Berselli, Jan 23 2013
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Perminova Maria, Jan 22 2013
STATUS
approved