This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A107625 #9 Sep 09 2019 10:58:13
%S A107625 409,4409,4999,6869,44699,44909,46499,48409,64849,66889,68449,68909,
%T A107625 86969,89689,98869,98899,480499,488689,490499,609809,806609,806999,
%U A107625 866969,868669,868849,869489,869849,869899,869909,880949,6440809,6440999,6488969,6489449
%N A107625 Every digit of prime and its index contains a loop (only digits 0,4,6,8,9 in prime and its index).
%C A107625 Corresponding indices in A107624. Cf. A001744 Every digit contains a loop.
%H A107625 Harvey P. Dale, <a href="/A107625/b107625.txt">Table of n, a(n) for n = 1..376</a>
%t A107625 Do[id=Union[IntegerDigits[p=Prime[n]], IntegerDigits[n]];If[Count[id, 1]+Count[id, 2]+Count[id, 3]+Count[id, 5]+Count[id, 7]==0, Print[p]], {n, 10000}]
%t A107625 Module[{c={0,4,6,8,9}},Select[Prime/@(Rest[FromDigits/@Tuples[c,6]]), SubsetQ[ c,IntegerDigits[#]]&]] (* _Harvey P. Dale_, Sep 03 2015 *)
%o A107625 (PARI) is_a001744(n) = #setintersect(vecsort(digits(n), , 8), [1, 2, 3, 5, 7])==0
%o A107625 my(i=1); forprime(p=1, 65e5, if(is_a001744(p) && is_a001744(i), print1(p, ", ")); i++) \\ _Felix Fröhlich_, Sep 09 2019
%Y A107625 Cf. A001744, A107624.
%K A107625 nonn,base,dumb
%O A107625 1,1
%A A107625 _Zak Seidov_, May 18 2005
%E A107625 More terms from _Harvey P. Dale_, Sep 03 2015