196419

Appears in sequences

• a(n) = Fibonacci(n) + 1.at n=27A001611
• Fibonacci(n) - (-1)^n.at n=26A007492
• Pisot sequences L(4,6), E(4,6).at n=23A020706
• Pisot sequences L(6,9), E(6,9).at n=22A020717
• One of four 3rd-order recurring sequences for which the first derived sequence and the Galois transformed sequence coincide.at n=14A032908
• Pisot sequence L(3,4).at n=24A048577
• 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=26A052959
• a(n) = Fibonacci(4n+3) + 1, or Fibonacci(2n+1)*Lucas(2n+2).at n=6A081005
• a(n) = F(n)*L(n+1) where F=Fibonacci and L=Lucas numbers.at n=13A081714
• a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum_{i = 1..n} (a(i) - a(1)).at n=14A093467
• a(n) = 1 + Fibonacci(n) - (Fibonacci(n) mod 2).at n=27A104220
• 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=27A109522
• Smallest squarefree integer > the n-th term of the Fibonacci sequence.at n=27A111077
• a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4, with initial terms 0,1,3,3.at n=26A111573
• 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=53A113222
• Number of base 17 n-digit numbers with adjacent digits differing by three or less.at n=6A126485
• Index of 1/n in the Fibonacci (or rabbit) ordering of the positive rationals.at n=24A226271
• Fibonacci shuffles: a(2n) = A000071(n) and a(2n+1) = A001611(n+2).at n=51A226649
• Sequence a(n) = 1 + A001519(n+1) appearing in a certain touching problem for three circles and a chord, together with A246638.at n=13A246640
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 1, a(1) = 1, a(2) = 2, a(3) = -2.at n=30A295675