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