52057

Properties

Appears in sequences

• Fibonacci numbers written backwards.at n=25A004091
• Reversals of Fibonacci numbers (sorted).at n=23A004170
• a(n) is the least odd prime p such that the maximum run length of consecutive quadratic residues modulo p is n.at n=22A025046
• Iccanobif (or iccanobiF) primes: primes which are Fibonacci numbers when reversed.at n=7A036797
• Numbers k such that 3^k - 4 is prime.at n=20A058959
• Smallest prime p such that the maximum run length of consecutive positive quadratic residues modulo p is n.at n=23A097159
• Greatest prime factor of 2*n^4 + 1.at n=21A140538
• Primes p such that both p^5 - 6 and p^5 + 6 are prime.at n=21A157256
• Primes that are anagrams of Fibonacci numbers.at n=33A162390
• Primes p such that p^p ends in p and p is not congruent to 1 (mod 10).at n=10A177192
• Numbers n such that n^2 + 1 is divisible by a 5th power.at n=33A218564
• Primes p such that the decimal expansion of p^5 ends in p.at n=24A224904
• Primes p such that p^4-p^3+1 and p^4-p^3-1 are also primes.at n=22A238136
• Primes of form n^2 + 4096.at n=33A256836
• Primes prime(k) such that (prime(k), prime(k+1)), (prime(k+2), prime(k+3)), (prime(k+4), prime(k+5)) form a triangle of area 2.at n=38A308649
• A(n, k) is the k-th number b > 1 such that b^(prime(n+i)-1) == 1 (mod prime(n+i)^2) for each i = 0..4, with k running over the positive integers; square array, read by antidiagonals, downwards.at n=6A319062
• a(1) is the smallest prime p such that 6*p^2-1 and 6*p^2+1 are twin primes; for n > 1, a(n) is the smallest prime q > a(n-1) such that 6*q^prime(n)-1 and 6*q^prime(n)+1 are twin primes or 0 if no solution exists.at n=4A327581
• Numbers b > 1 such that the smallest five primes, i.e., 2, 3, 5, 7 and 11 are base-b Wieferich primes.at n=3A339534
• Prime numbersat n=5324