50207

Properties

Appears in sequences

• Euclid-Mullin sequence: a(1) = 2, a(n+1) is the largest prime factor of 1 + Product_{k=1..n} a(k).at n=5A000946
• Primes p such that the Fibonacci iterations starting with (1, p) lead to a "nine digits anagram".at n=6A034588
• Essentially a duplicate of A000946.at n=6A083369
• Let a(1)=1; for n>1, a(n)=nextprime((3/2)*a(n-1)).at n=24A084571
• Base-6 pandigital primes: primes having at least one of each digit 0,1,2,3,4,5 when written in base 6.at n=5A175278
• A variant of the Euclid-Mullin sequence A000945: a(1) = 2, a(n+1) is smallest prime factor congruent to 3 (mod 4) of Product_{k=1..n} a(k) + 1.at n=5A218467
• Erroneous version of A000946.at n=5A241166
• Smallest prime factor of 4*n! - 1.at n=22A262375
• Primes p congruent to 1 modulo 13 such that x^13 = 2 has a solution modulo p.at n=33A275773
• Smallest prime of the form 4*k + 3 that is a divisor of 4*n! - 1.at n=22A333924
• 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=6A376605
• Primes having only {0, 2, 5, 7} as digits.at n=39A386049
• Prime numbersat n=5154