433494437

Properties

Appears in sequences

• a(n) = 3*a(n-1) - a(n-2) for n >= 2, with a(0) = a(1) = 1.at n=22A001519
• Smallest primitive prime factor of Fibonacci number F(n), or 1 if F(n) has no primitive prime factor.at n=42A001578
• Prime Fibonacci numbers.at n=9A005478
• Odd Fibonacci numbers.at n=28A014437
• a(n) = Fibonacci(prime(n)).at n=13A030426
• a(n) = Fibonacci(3*n + 1).at n=14A033887
• a(n) = Fibonacci(4*n+3).at n=10A033891
• Primes of the form F(i)^2 + F(j)^2, where F() are Fibonacci numbers.at n=22A045703
• Fibonacci numbers having initial digit '4'.at n=2A045728
• Pisot sequences L(2,5), E(2,5).at n=20A048575
• Fibonacci(k) starting with digits of its index number k.at n=3A052000
• a(1) = a(2) = 1; for n >2, a(n) = smallest prime factor of n-th Fibonacci number.at n=42A060383
• Largest prime factor of n-th Fibonacci number.at n=40A060385
• Squarefree Fibonacci numbers.at n=34A061305
• Primitive part of Fibonacci(n).at n=42A061446
• Factorize the Fibonacci numbers in order, skipping F(0)-F(2), F(6)=8 and F(12)=144; at each step at least one new prime will occur; append to the sequence the smallest such new prime.at n=38A061488
• Sum of primes dividing Fibonacci(n) (with repetition).at n=42A064725
• Fibonacci numbers whose digits sum to a prime.at n=19A065398
• Smallest Fibonacci number containing exactly n 4's.at n=3A072319
• Smallest Fibonacci number containing exactly n 3's.at n=2A072320