35291

Properties

Appears in sequences

• a(1)=2; a(n) for n>1 is the smallest prime number > a(n-1) such that the concatenation of all previous terms is also prime.at n=38A080155
• Number of unlabeled octagonal 2-trees with n octagons.at n=7A094652
• Start with 1 and repeatedly reverse the digits and add 38 to get the next term.at n=23A118634
• Primes of the form 7n^2 + 4.at n=18A201605
• Primes p whose last digit is the same as that of both its predecessor prime and its successor prime.at n=36A298075
• a(n) equals the smallest Sophie Germain prime q such that pi_(p,2p+1)(q,10,(1,3)) - pi_(p,2p+1)(q,10,(3,1)) = n, where pi_(p,2p+1)(q,10,(b,c)) equals the number of Sophie Germain primes A005384(i) such A005384(i) <= q and (A005384(i),A005384(i+1)) == (b,c) (mod 10).at n=10A333084
• Prime numbersat n=3760