74847

Appears in sequences

• a(1) = 3; for n > 1, choose a(n) to be the smallest number such that a(n) > a(n-1) and (a(n)*a(n-1)+1) mod (a(n)+a(n-1)+1) = 0.at n=10A064457
• Beginning with 2, smallest palindrome >= the previous term such that every concatenation is a prime.at n=18A088093