a(1) = 2; for n>1, a(n) is the least prime with all prime digits which is == 1 (mod a(n-1)).
A100763
a(1) = 2; for n>1, a(n) is the least prime with all prime digits which is == 1 (mod a(n-1)).
Terms
- a(0) =2a(1) =3a(2) =7a(3) =337a(4) =32353a(5) =7727255227
External references
- oeis: A100763