105937

Appears in sequences

• a(n) = 7*a(n-1) - a(n-2) with a(0) = 0, a(1) = 1.at n=7A004187
• a(n) = floor(Fibonacci(n)/3).at n=28A004696
• Rectangular array of numbers Fibonacci(m(n+1))/Fibonacci(m), m >= 1, n >= 0, read by downward antidiagonals.at n=51A028412
• 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=25A031122
• Denominators of continued fraction convergents to sqrt(45).at n=13A041077
• a(n) = F(8*n+4)/3, where F=A000045 (the Fibonacci sequence).at n=3A049678
• Denominators of the continued fraction n-1/(n-1/...) [n times].at n=6A097691
• A Fibonacci convolution.at n=13A099483
• A Fibonacci convolution.at n=13A099484
• Largest proper divisor of the Fibonacci numbers > 1.at n=25A139045
• a(n) = Product_{k=1..(n-1)/2} (5 + 4*cos(k*Pi/n)^2).at n=14A152119
• Triangle T(n, k, m) = t(n, m)/(t(k, m)*t(n-k, m)), where t(n, k) = Product_{j=1..n} p(j, k+1), p(n, x) = Sum_{j=0..n} (-1)^j*A053122(n, j)*x^j, and m = 8, read by rows.at n=29A156602
• Triangle T(n, k, m) = t(n, m)/(t(k, m)*t(n-k, m)), where t(n, k) = Product_{j=1..n} p(j, k+1), p(n, x) = Sum_{j=0..n} (-1)^j*A053122(n, j)*x^j, and m = 8, read by rows.at n=34A156602
• Numerator of x(n) = x(n-1) + x(n-2), x(0)=0, x(1)=1/3; denominator=A167817.at n=28A167816
• Array T(m,n) = Fibonacci(m*n)/Fibonacci(m), by antidiagonals; transpose of A028412.at n=48A214978
• Power ceiling array for the golden ratio, by antidiagonals.at n=59A214986
• Power round array for the golden ratio, by antidiagonals.at n=59A214987
• Number of n X 3 0..1 arrays with diagonals and rows unimodal and antidiagonals nondecreasing.at n=8A224153
• a(n) = ceiling(Fibonacci(n)/3).at n=28A293543
• a(n) = round(Fibonacci(n)/3).at n=28A293544