2971215073

Appears in sequences

• a(n) = 3*a(n-1) - a(n-2) for n >= 2, with a(0) = a(1) = 1.at n=24A001519
• Smallest primitive prime factor of Fibonacci number F(n), or 1 if F(n) has no primitive prime factor.at n=46A001578
• Prime Fibonacci numbers.at n=10A005478
• Odd Fibonacci numbers.at n=31A014437
• a(0) = 1, a(1) = 1, and a(n) = 4*a(n-1) + a(n-2) for n >= 2.at n=16A015448
• Smallest Fibonacci number beginning with n.at n=29A020345
• a(n) = Fibonacci(prime(n)).at n=14A030426
• a(n) = Fibonacci(4*n+3).at n=11A033891
• Primes of the form F(i)^2 + F(j)^2, where F() are Fibonacci numbers.at n=23A045703
• Fibonacci numbers having initial digit '2'.at n=8A045726
• Pisot sequences L(2,5), E(2,5).at n=22A048575
• Fibonacci numbers containing no pair of consecutive equal digits (probably finite).at n=30A050762
• a(1) = a(2) = 1; for n >2, a(n) = smallest prime factor of n-th Fibonacci number.at n=46A060383
• Largest prime factor of n-th Fibonacci number.at n=44A060385
• 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=42A061488
• Sum of primes dividing Fibonacci(n) (with repetition).at n=46A064725
• Fibonacci numbers whose digits sum to a prime.at n=21A065398
• a(n) = F(L(n)) where F(n) = n-th Fibonacci number and L(n) = n-th Lucas number.at n=8A068096
• Squarefree Fibonacci numbers with odd number of prime factors.at n=21A074691
• Fibonacci numbers F(k) for k squarefree (A005117).at n=30A075731