1860497

Appears in sequences

• a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 2.at n=29A001610
• a(n) = F(2n+1) + F(2n-1) - 1.at n=15A005592
• a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.at n=30A014217
• a(n) = 5*F(n)^2 + 3*(-1)^n where F(n) are the Fibonacci numbers A000045.at n=15A047946
• Shifts left two places under BIN1 transform.at n=30A052341
• Cyclotomic polynomials Phi_n at x=phi, ceiled up (where phi = tau = (sqrt(5)+1)/2).at n=29A063707
• a(n) = Fibonacci(n-1) + Fibonacci(n+1) - (-1)^n.at n=30A098600
• a(n) = Lucas(3*n) - 1.at n=10A100233
• Antidiagonal sums of a triangle of coefficients of recurrences of the Fibonacci sequence.at n=58A138123
• Odd numbers in A138123.at n=28A142248
• Odd terms in A014217.at n=15A142718
• Terms in A014217 pairwise swapped.at n=31A154699
• Continued fraction expansion for exp( Sum_{n>=1} 1/(n*Lucas(n)) ), where Lucas(n) = A000032(n) = ((1+sqrt(5))/2)^n + ((1-sqrt(5))/2)^n.at n=42A174505
• Continued fraction expansion for exp( Sum_{n>=1} 1/(n*A014448(n)) ), where A014448(n) = (2+sqrt(5))^n + (2-sqrt(5))^n.at n=14A174506
• a(n) = numerator of Sum_{i=1..n} binomial(2n-i-1,i-1)/i.at n=14A175385
• a(n) = a(n-1) + a(n-2) + (-1)^n, with a(0)=0 and a(1)=1.at n=31A181716
• Subsequence of A014217 (n=2,3,5,6,8,9,11,12,...).at n=19A182642
• a(n) = numerator of B(0,n) where B(n,n) = 0, B(n-1,n) = 1/n, and B(m,n) = B(m-1,n+1) - B(m-1,n).at n=29A189731
• Partial sums of A215602.at n=14A215580
• a(n) = A000045(n) / A105800(n); the n-th Fibonacci number divided by its largest Fibonacci proper divisor.at n=44A280690