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 A107624 #8 Sep 09 2019 10:58:07
%S A107624 80,600,669,884,4646,4666,4806,4980,6480,6666,6806,6849,8448,8688,
%T A107624 9489,9494,40046,40664,40804,49848,64444,64466,68864,68994,69008,
%U A107624 69060,69084,69089,69090,69899,440986,440999,444049,444080,464446,464496,464499,466466,466844
%N A107624 Numbers n such that every digit of n and n-th prime contains a loop (only digits 0,4,6,8,9 in n and n-th prime).
%C A107624 Corresponding primes in A107625. Cf. A001744 Every digit contains a loop.
%t A107624 Do[id=Union[IntegerDigits[Prime[n]], IntegerDigits[n]];If[Count[id, 1]+Count[id, 2]+Count[id, 3]+Count[id, 5]+Count[id, 7]==0, Print[n]], {n, 10000}]
%o A107624 (PARI) is_a001744(n) = #setintersect(vecsort(digits(n), , 8), [1, 2, 3, 5, 7])==0
%o A107624 is(n) = is_a001744(n) && is_a001744(prime(n)) \\ _Felix Fröhlich_, Sep 09 2019
%Y A107624 Cf. A001744, A107625.
%K A107624 nonn,base,dumb
%O A107624 1,1
%A A107624 _Zak Seidov_, May 18 2005
%E A107624 More terms from _Felix Fröhlich_, Sep 09 2019