514229

Properties

Appears in sequences

• a(n) = 3*a(n-1) - a(n-2) for n >= 2, with a(0) = a(1) = 1.at n=15A001519
• Smallest primitive prime factor of Fibonacci number F(n), or 1 if F(n) has no primitive prime factor.at n=28A001578
• Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x^2 + y^2 + z^2 = 3*x*y*z.at n=37A002559
• 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=29A005247
• Prime Fibonacci numbers.at n=8A005478
• Duplicate of A001519.at n=15A011783
• Odd Fibonacci numbers.at n=19A014437
• a(0) = 1, a(1) = 1, and a(n) = 4*a(n-1) + a(n-2) for n >= 2.at n=10A015448
• Pisot sequence E(2,3).at n=26A020695
• Pisot sequences E(3,5), P(3,5).at n=25A020701
• Pisot sequences E(5,8), P(5,8).at n=24A020712
• a(n) = Fibonacci(prime(n)).at n=9A030426
• a(n) = Fibonacci(4*n + 1).at n=7A033889
• 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=31A036415
• Concatenation of prime factors of n-th Fibonacci number.at n=26A038526
• 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=31A039834
• Primes of the form F(i)^2 + F(j)^2, where F() are Fibonacci numbers.at n=17A045703
• Fibonacci numbers having initial digit '5'.at n=2A045729
• Pisot sequences L(2,5), E(2,5).at n=13A048575
• Fibonacci(k) ending with digits of its index number k.at n=4A050816