|
MATHEMATICA
|
M = {{0, 1, 0, 1, 1, 0, 0, 1}, {1, 0, 1, 0, 1, 1, 0, 0}, {0, 1, 0, 1, 0, 1, 1, 0}, {1, 0, 1, 0, 0, 0, 1, 1}, {1, 1, 0, 0, 0, 0, 0, 0}, {0, 1, 1, 0, 0, 0, 0, 0}, {0, 0, 1, 1, 0, 0, 0, 0}, {1, 0, 0, 1, 0, 0, 0, 0}}; v[1] = Table[Fibonacci[n], {n, 8}]; v[n_]:= v[n]= M.v[n-1]; Table[Floor[v[n][[1]]], {n, 50}]
CoefficientList[Series[x(1+30x+49x^2-71x^3-116x^4)/((2x+1)(4x^2+2x-1) (2x^2-1)), {x, 0, 30}], x] (* Harvey P. Dale, Jul 24 2011 *)
LinearRecurrence[{0, 10, 8, -16, -16}, {1, 30, 59, 237, 698}, 30] (* Harvey P. Dale, Jun 09 2016 *)
Table[If[EvenQ[n], (2^n*(47*Fibonacci[n+1] -40*Fibonacci[n] +1) + 10*2^(n/2))/8, (2^n*(47*Fibonacci[n+1] - 40*Fibonacci[n] -1) - 2^((n-1)/2 +2))/8], {n, 40}] (* G. C. Greubel, Oct 05 2019 *)
|