Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1, but with Binet formula the fibonacci number is described as F(n)=(pow(a,n)–pow(b,n))/sqrt(5) where a=(1+sqrt(5))/2 and b=(1–sqrt(5))/2. (Program in Error for n>78)
Q. Sad(F(n))=n where Sad(M): Sum of all digits of M. What are the Fibonacci numbers with a digit sum equal to its index number? http://oeis.org/A020995 https://oeis.org/A007953
