75026

Appears in sequences

• a(n) = Fibonacci(n) + 1.at n=25A001611
• Fibonacci(n) - (-1)^n.at n=24A007492
• a(n+1) = a(n) - F(n) if > 0, otherwise a(n) + F(n), where F() are Fibonacci numbers; a(0) = 0.at n=25A011369
• Pisot sequences L(4,6), E(4,6).at n=21A020706
• Pisot sequences L(6,9), E(6,9).at n=20A020717
• One of four 3rd-order recurring sequences for which the first derived sequence and the Galois transformed sequence coincide.at n=13A032908
• Pisot sequence L(3,4).at n=22A048577
• 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=24A052959
• Numbers that are Fibonacci numbers plus or minus 1.at n=45A061489
• a(n) = Fibonacci(n+1)+cos(n*Pi/2).at n=24A074662
• a(n) = Fibonacci(4n+1) + 1, or Fibonacci(2n+1)*Lucas(2n).at n=6A081003
• Third column (m=4) of array A090452.at n=27A090453
• a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum_{i = 1..n} (a(i) - a(1)).at n=13A093467
• 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=25A109522
• Smallest squarefree integer > the n-th term of the Fibonacci sequence.at n=25A111077
• a(n) = Sum_{p^e | n} F(p^e), where each p^e is the highest power of prime p dividing n (with e > 0), and F(k) is the k-th Fibonacci number.at n=49A113222
• a(n) = Fibonacci(n)*Lucas(n-1).at n=13A128534
• Inverse Möbius transform of odd-indexed Fibonacci numbers.at n=12A130095
• a(0)=1. a(n) = the smallest integer coprime to a(n-1) and greater than the n-th Fibonacci number.at n=25A157420
• Index of 1/n in the Fibonacci (or rabbit) ordering of the positive rationals.at n=22A226271