165580142

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=42A011369
• Pisot sequences L(4,6), E(4,6).at n=37A020706
• Pisot sequences L(6,9), E(6,9).at n=36A020717
• One of four 3rd-order recurring sequences for which the first derived sequence and the Galois transformed sequence coincide.at n=21A032908
• Pisot sequence L(3,4).at n=38A048577
• 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=40A052959
• a(n) = Fibonacci(4n+1) + 1, or Fibonacci(2n+1)*Lucas(2n).at n=10A081003
• a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum_{i = 1..n} (a(i) - a(1)).at n=21A093467
• a(n) = Fibonacci(n)*Lucas(n-1).at n=21A128534
• a(n) = Fibonacci(n) * Sum_{d|n} -(-1)^(n/d) / Fibonacci(d).at n=40A203802
• G.f.: A(x) = Sum_{n>=0} x^n / (1 - x^n - x^(2*n))^n.at n=41A223547
• Index of 1/n in the Fibonacci (or rabbit) ordering of the positive rationals.at n=38A226271
• Sequence a(n) = 1 + A001519(n+1) appearing in a certain touching problem for three circles and a chord, together with A246638.at n=20A246640