93544

Appears in sequences

• This table shows the coefficients of sum formulas of n-th Fibonacci numbers (A000045). The k-th row (k>=1) contains T(i,k) for i=1 to k, where k=[2*n+1+(-1)^(n-1)]/4 and T(i,k) satisfies F(n)= Sum_{i=1..k} T(i,k) * n^(k-i)/(k-1)!.at n=25A099731
• Consider the 2^n values of A139250(i)/i^2 for 2^n <= i < 2^(n+1); a(n) = value of i where this quantity is minimized.at n=16A170927
• Pisot sequences L(5,12), S(5,12).at n=11A277088