439205
domain: N
Appears in sequences
- a(n) = a(n-1) + a(n-2) - 1 for n > 1, a(0)=3, a(1)=2.at n=27A001612
- Least m such that if r and s in {-F(2*h) + phi*F(2*h-1): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers) and phi = (1+sqrt(5))/2 (golden ratio).at n=13A024851
- a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.at n=27A062724
- a(n) = Lucas(n+1) + (3*(-1)^n - 1)/2.at n=26A074392
- a(n) = Lucas(4n+3) + 1, or 5*Fibonacci(2n+1)*Fibonacci(2n+2).at n=6A081015
- a(n) = Sum_{k=0..n} Fibonacci(k) + (-1)^k*Fibonacci(k-1).at n=27A097132
- a(n) = Fibonacci(n-1) + Fibonacci(n+1) - (-1)^n.at n=27A098600
- Ceiling(phi^n) where phi = (1+sqrt(5))/2.at n=27A169986
- a(n) = a(n-1) + a(n-2) + (-1)^n, with a(0)=0 and a(1)=1.at n=28A181716
- Partial sums of A005248.at n=13A188378
- Partial sums of the squares of Lucas numbers (A000032).at n=13A216243