141961

Properties

Appears in sequences

• Smallest primitive prime factor of Fibonacci number F(n), or 1 if F(n) has no primitive prime factor.at n=34A001578
• Quintan primes: p = (x^5 + y^5)/(x + y).at n=36A002650
• a(n) = F(n) / Product_{p|n} F(p), where F(k) is k-th Fibonacci number and the p's in product are the distinct primes dividing n.at n=34A051348
• Largest prime factor of n-th Fibonacci number.at n=32A060385
• Primitive part of Fibonacci(n).at n=34A061446
• 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=30A061488
• Primes with 31 as smallest positive primitive root.at n=17A061735
• Quotient Fibonacci(5*n)/(5*Fibonacci(n)), where Fibonacci(n) = A000045(n).at n=6A088545
• a(n) = F(n)/Product_{p=primes} F(p^(m_{n,p})), where p^(m_{n,p}) is highest power of p dividing n, m= nonnegative integer and F(k) is the k-th Fibonacci number.at n=34A113196
• a(n) = F(n-th squarefree)/product{p=primes,p|(n-th squarefree)} F(p), where F(m) is m-th Fibonacci number.at n=22A115022
• Largest prime divisor of Fibonacci(5n).at n=6A121170
• Largest prime divisor of Fibonacci(5n).at n=13A121170
• Sums of the form (twin primes + 1) which are also an upper twin prime.at n=20A158870
• Prime numbers that are Fibonacci integers.at n=39A178762
• Product of primitive prime factors of Fibonacci(n).at n=34A178763
• Fourth prime p such that (p+n)^2+n is prime but (p+j)^2+j is not prime for all 0<j<n.at n=37A238676
• Largest primitive prime factor of Fibonacci number F(n), or 1 if no primitive.at n=34A262341
• Primes p such that if q and r are the next two primes, (p - 1)^2 + 1, (q - 1)^2 + 1 and (r - 1)^2 + 1 are all prime.at n=12A376605
• a(n) = 1 - 5*(n + 1)^2 + 5*(n + 1)^4.at n=12A385897
• Prime numbersat n=13182