433494438

Appears in sequences

• a(n+1) = a(n) - F(n) if > 0, otherwise a(n) + F(n), where F() are Fibonacci numbers; a(0) = 0.at n=43A011369
• One of four 3rd-order recurring sequences for which the first derived sequence and the Galois transformed sequence coincide.at n=22A032908
• 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=42A052959
• a(n) = Fibonacci(4n+3) + 1, or Fibonacci(2n+1)*Lucas(2n+2).at n=10A081005
• a(n) = F(n)*L(n+1) where F=Fibonacci and L=Lucas numbers.at n=21A081714
• a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum_{i = 1..n} (a(i) - a(1)).at n=22A093467
• Sequence a(n) = 1 + A001519(n+1) appearing in a certain touching problem for three circles and a chord, together with A246638.at n=21A246640