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 A107613 #18 Feb 07 2019 02:18:22
%S A107613 94,1140,9109,10404,10449,41104,110000,110010,114101,910140,910190,
%T A107613 910191,940111,940141,940409,11049914,94011001,94011004,94019941,
%U A107613 94019990,94109190,94109191,94440910,190004449,190011049,190011090,190011091,190011909,190011999,190149101
%N A107613 Numbers n such that both n and prime(n) consist of square digits (0,1,4,9).
%C A107613 Corresponding primes are: 491, 9199, 94441, 109441, 109919, 494441, 1441049, 1441199, 1499149, which form a subsequence of A061246 (primes with square digits).
%H A107613 Chai Wah Wu, <a href="/A107613/b107613.txt">Table of n, a(n) for n = 1..216</a>
%t A107613 Do[id=Union[IntegerDigits[Prime[n]], IntegerDigits[n]];If[Count[id, 2]+Count[id, 3]+Count[id, 5]+Count[id, 6]+Count[id, 7]+Count[id, 8]==0, Print[n]], {n, 200000}]
%Y A107613 Cf. A061246.
%K A107613 nonn,base
%O A107613 1,1
%A A107613 _Zak Seidov_, May 17 2005
%E A107613 a(10)-a(30) from _Chai Wah Wu_, Jan 30 2019