1346269

Appears in sequences

• a(n) = 3*a(n-1) - a(n-2) for n >= 2, with a(0) = a(1) = 1.at n=16A001519
• a(n) = 3*a(n-2) - a(n-4), a(0)=2, a(1)=1, a(2)=3, a(3)=2. Alternates Lucas (A000032) and Fibonacci (A000045) sequences for even and odd n.at n=31A005247
• Odd Fibonacci numbers.at n=20A014437
• Pisot sequence E(2,3).at n=28A020695
• Pisot sequences E(3,5), P(3,5).at n=27A020701
• Pisot sequences E(5,8), P(5,8).at n=26A020712
• a(n) = Fibonacci(prime(n)).at n=10A030426
• a(n) = Fibonacci(3*n + 1).at n=10A033887
• a(n) = Fibonacci(4*n+3).at n=7A033891
• a(n+2) = -a(n+1) + a(n) (signed Fibonacci numbers) with a(-2) = a(-1) = 1; or Fibonacci numbers (A000045) extended to negative indices.at n=33A039834
• Fibonacci numbers having initial digit '1'.at n=8A045725
• Pisot sequences L(2,5), E(2,5).at n=14A048575
• Converse numbers: composite Fibonacci numbers Fib(k) that are congruent to Legendre symbol (k/5) mod k.at n=2A048593
• Fibonacci numbers containing no pair of consecutive equal digits (probably finite).at n=23A050762
• Nonprime Fibonacci numbers with a prime index.at n=2A050937
• Expansion of x/(x^4-3*x^3+4*x^2-2*x+1).at n=31A051111
• Fibonacci numbers which are semiprimes.at n=7A053409
• Earliest sequence with a(a(n)) = Fibonacci(n+1).at n=31A054049
• Squarefree Fibonacci numbers.at n=24A061305
• Primitive part of Fibonacci(n).at n=30A061446