196418

Appears in sequences

• a(n) = 3*a(n-1) - a(n-2) for n >= 2, with a(0) = a(1) = 1.at n=14A001519
• Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x^2 + y^2 + z^2 = 3*x*y*z.at n=33A002559
• 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=27A005247
• Duplicate of A001519.at n=14A011783
• Even Fibonacci numbers; or, Fibonacci(3*n).at n=9A014445
• Smallest Fibonacci number beginning with n.at n=19A020345
• Pisot sequence E(2,3).at n=24A020695
• Pisot sequences E(3,5), P(3,5).at n=23A020701
• Pisot sequences E(5,8), P(5,8).at n=22A020712
• Least Fibonacci number ending with n.at n=18A023184
• a(n) = Fibonacci(4*n+3).at n=6A033891
• Values of k for which there are no empty intervals when fractional part(m*phi) for m = 1, ..., k is plotted along [ 0, 1 ] subdivided into k equal regions.at n=29A036415
• 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=29A039834
• a(n+1) = 5*a(n)^3 - 3*a(n), a(0) = 1.at n=3A045529
• Fibonacci numbers having initial digit '1'.at n=7A045725
• Pisot sequences L(2,5), E(2,5).at n=12A048575
• Fibonacci numbers containing no pair of consecutive equal digits (probably finite).at n=21A050762
• Smallest Fibonacci number that is divisible by n-th prime.at n=15A051694
• Earliest sequence with a(a(n)) = Fibonacci(n+1).at n=27A054049
• Erroneous version of A051694.at n=14A060321