7727255227

Appears in sequences

• a(1) = 2; for n>1, a(n) is the least prime with all prime digits which is == 1 (mod a(n-1)).at n=5A100763