514230

Appears in sequences

• a(n) = Fibonacci(n) + 1.at n=29A001611
• Inverse Moebius transform of Fibonacci numbers 1,1,2,3,5,8,...at n=28A007435
• Fibonacci(n) - (-1)^n.at n=28A007492
• a(n+1) = a(n) - F(n) if > 0, otherwise a(n) + F(n), where F() are Fibonacci numbers; a(0) = 0.at n=30A011369
• Pisot sequences L(4,6), E(4,6).at n=25A020706
• Pisot sequences L(6,9), E(6,9).at n=24A020717
• One of four 3rd-order recurring sequences for which the first derived sequence and the Galois transformed sequence coincide.at n=15A032908
• Pisot sequence L(3,4).at n=26A048577
• a(2n) = a(2n-1)+a(2n-2), a(2n+1) = a(2n)+a(2n-1)-1, a(0)=2, a(1)=1.at n=28A052959
• a(n) is the sum of the divisors of Fibonacci(n) (A000045).at n=28A063477
• a(n) = Fibonacci(n+1)+cos(n*Pi/2).at n=28A074662
• a(n) = Fibonacci(4n+1) + 1, or Fibonacci(2n+1)*Lucas(2n).at n=7A081003
• a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum_{i = 1..n} (a(i) - a(1)).at n=15A093467
• a(n) = the (1,2)-entry in the matrix P^n + F^n, where the 2 X 2 matrices P and F are defined by P=[0,1;1,0] and F=[0,1;1,1].at n=29A109522
• a(n) = F(n) * Sum_{k|n} 1/F(k), where F(k) is the k-th Fibonacci number.at n=28A111075
• Smallest squarefree integer > the n-th term of the Fibonacci sequence.at n=29A111077
• a(n) = Fibonacci(n)*Lucas(n-1).at n=15A128534
• Sum of odd divisors of Fibonacci(n).at n=28A193293
• a(n) = Fibonacci(n) * Sum_{d|n} -(-1)^(n/d) / Fibonacci(d).at n=28A203802
• G.f.: A(x) = Sum_{n>=0} x^n / (1 - x^n - x^(2*n))^n.at n=29A223547