726103

Appears in sequences

• a(n) = 7*a(n-1) - a(n-2) with a(0) = 0, a(1) = 1.at n=8A004187
• a(n) = floor(Fibonacci(n)/3).at n=32A004696
• 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=32A031122
• Denominators of continued fraction convergents to sqrt(45).at n=15A041077
• a(n) = Fibonacci(8n)/3.at n=4A049686
• Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+3) = FL(n+3)Product(L(2^i)^bit(n,i),i=0..).at n=13A050612
• Products of distinct terms of 1 and rest from A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^i)^bit(n,i).at n=28A050613
• Products of distinct terms of 1 and rest from A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^i)^bit(n,i).at n=29A050613
• Products of distinct terms of A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^(i+1))^bit(n,i).at n=14A050614
• Sum_{i=0..2*A053645(n)} (C(2*A053645(n),i) mod 2)*A000045(n-i) [where C(r,c) is the binomial coefficient (A007318) and A000045(n) is the n-th Fibonacci number].at n=29A075149
• Numerators of the continued fraction n-1/(n-1/...) [n times].at n=6A097690
• A Fibonacci convolution.at n=15A099483
• A Fibonacci convolution.at n=15A099484
• Largest proper divisor of the Fibonacci numbers > 1.at n=29A139045
• a(n) = Product_{k=1..(n-1)/2} (5 + 4*cos(k*Pi/n)^2).at n=16A152119
• Numerator of x(n) = x(n-1) + x(n-2), x(0)=0, x(1)=1/3; denominator=A167817.at n=32A167816
• Numbers of the form Fibonacci(2^c)/Fibonacci(2^b), 1 <= b < c.at n=8A181393
• Numbers of the form Fibonacci(p^c)/Fibonacci(p^b), where p is some prime and 1<=b<c are two integer exponents.at n=12A181420
• a(n) = ceiling(Fibonacci(n)/3).at n=32A293543
• a(n) = round(Fibonacci(n)/3).at n=32A293544