|
|
MAPLE
| with(combinat): a := proc(n) local aa, b, c, d, lambda, delta, R, S, F, L, m, l: m:=3: l:=2: F := n -> fibonacci(n): L := n -> fibonacci(n-1)+fibonacci(n+1): aa := (m, l) -> L(2*m)*F(l-2)+F(2*m+2)*F(l-1): b := (m, l) -> L(2*m)*F(l-1)+F(2*m+2)*F(l): c := (m, l) -> F(2*m+2)*F(l-2)+F(m+2)^2*F(l-1): d := (m, l) -> F(2*m+2)*F(l-1)+F(m+2)^2*F(l): lambda := (m, l) -> (d(m, l)+aa(m, l)+sqrt((d(m, l)-aa(m, l))^2+4*b(m, l)*c(m, l)))*(1/2): delta := (m, l) -> (d(m, l)+aa(m, l)-sqrt((d(m, l)-aa(m, l))^2+4*b(m, l)*c(m, l)))*(1/2): R := (m, l) -> ((lambda(m, l)-d(m, l))*L(2*m)+b(m, l)*F(2*m+2))/(2*lambda(m, l)-d(m, l)-aa(m, l)): S := (m, l) -> ((lambda(m, l)-aa(m, l))*L(2*m)-b(m, l)*F(2*m+2))/(2*lambda(m, l)-d(m, l)-aa(m, l)): simplify(R(m, l)*lambda(m, l)^(n-1)+S(m, l)*delta(m, l)^(n-1)); end proc;
|
