98209

Appears in sequences

• Denominators of continued fraction convergents to sqrt(5).at n=9A001076
• a(n) = floor(Fibonacci(n)/2).at n=27A004695
• a(n) = Sum_{k=0..floor(n/4)} binomial(n-2k,2k).at n=26A005252
• a(n) = Fibonacci(6*n + 3)/2.at n=4A007805
• a(n) = 9th Fibonacci polynomial evaluated at 2^n.at n=2A020535
• a(n) = C(n-1,1) + C(n-3,3) + ... + C(n-2*m-1,2*m+1), where m = floor((n-2)/4).at n=24A024490
• 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=21A031122
• Denominators of continued fraction convergents to sqrt(20).at n=8A041031
• Denominators of continued fraction convergents to sqrt(45).at n=12A041077
• Denominators of continued fraction convergents to sqrt(80).at n=8A041143
• a(n) = F(n) / Product_{p|n} F(p), where F(k) is k-th Fibonacci number and the p's in product are the distinct primes dividing n.at n=26A051348
• Expansion of x*(1 + x - 2*x^2) / ( 1 - 4*x^2 - x^4).at n=18A059973
• a(n) = n*(5*n^2 - 3)/2.at n=34A063522
• Nonprimes which are the average of two consecutive Fibonacci numbers.at n=7A071683
• a(1)=1; for n > 2, a(n) is the smallest integer > a(n-1) such that frac(sqrt(5)*a(n)) < frac(sqrt(5)*a(n-1)).at n=16A079497
• Greedy frac multiples of sqrt(5): a(1)=1, sum(n>0,frac(a(n)*x))=1 at x=sqrt(5).at n=12A079936
• a(n) = floor((Fibonacci(2*n+1)+1)/2).at n=13A087953
• Expansion of (1+x)/((1+x+x^2)(1-x-x^2)).at n=25A093040
• A Fibonacci convolution.at n=26A094686
• Row sums of triangle A099510, so that a(n) = Sum_{k=0..n} coefficient of z^k in (1 + 2*z + z^2)^(n-[k/2]), where [k/2] is the integer floor of k/2.at n=12A099511