166408

Appears in sequences

• a(n) = floor(Fibonacci(n)/5).at n=30A004698
• Rectangular array of numbers Fibonacci(m(n+1))/Fibonacci(m), m >= 1, n >= 0, read by downward antidiagonals.at n=50A028412
• Integers that appear as ratios of Fibonacci numbers F(kn)/F(k), but omitting Fibonacci numbers F(n)/F(1) and Lucas numbers F(2n)/F(n).at n=26A031122
• a(n) = Fibonacci(5*n)/5.at n=6A049666
• a(n) = floor(L^3*{phi^(3*n-2), phi^(3*n-1), phi^(3*n-2) + phi^(3*n-1)}) where L = (1 + sqrt(5))/(2*sqrt(5)) and phi = (1 + sqrt(5))/2.at n=26A115315
• a(n) = Fibonacci(6, n).at n=11A124152
• Fibonacci(n*(n+1)) / Fibonacci(n).at n=4A205505
• [s(k)-s(j)]/10, where the pairs (k,j) are given by A205877 and A205878, and s(k) denotes the (k+1)-st Fibonacci number.at n=39A205880
• Array T(m,n) = Fibonacci(m*n)/Fibonacci(m), by antidiagonals; transpose of A028412.at n=49A214978
• Power round array for the golden ratio, by antidiagonals.at n=60A214987
• a(n) is the least integer k such that k/Fibonacci(n) > 1/5.at n=30A293637
• a(n) is the integer k that minimizes |k/Fibonacci(n) - 1/5|.at n=30A293638
• Unique solution x of the congruence x^2 = -1 (mod m(n)), with m(n) = A002559(n) (Markoff numbers) in the interval [1, floor(m(n)/2)], assuming the Markoff uniqueness conjecture, for n >= 3.at n=52A324601