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 A034470 #20 Nov 26 2014 20:16:15 %S A034470 2,3,5,23,29,53,59,83,89,223,229,233,239,263,269,283,293,353,359,383, %T A034470 389,503,509,523,563,569,593,599,653,659,683,809,823,829,839,853,859, %U A034470 863,883,929,953,983,2003,2029,2039,2053,2063,2069,2083,2089,2099,2203 %N A034470 Prime numbers using only the curved digits 0, 2, 3, 5, 6, 8 and 9. %C A034470 Intersection of A000040 and A028374. - _K. D. Bajpai_, Sep 07 2014 %H A034470 K. D. Bajpai, <a href="/A034470/b034470.txt">Table of n, a(n) for n = 1..10000</a> %e A034470 From _K. D. Bajpai_, Sep 07 2014: (Start) %e A034470 29 is prime and is composed only of the curved digits 2 and 9. %e A034470 359 is prime and is composed only of the curved digits 3, 5 and 9. %e A034470 (End) %e A034470 20235869 is the smallest instance using all curved digits. - _Michel Marcus_, Sep 07 2014 %p A034470 N:= 4: # to get all entries with at most N digits %p A034470 S:= {0,2,3,5,6,8,9}: %p A034470 T:= S: %p A034470 for j from 2 to N do %p A034470 T:= map(t -> seq(10*t+s,s=S),T); %p A034470 od: %p A034470 select(isprime,T); %p A034470 # In Maple 11 and earlier, uncomment the next line: %p A034470 # sort(convert(%,list)); # _Robert Israel_, Sep 07 2014 %t A034470 Select[Range[2222], PrimeQ[#] && Union[Join[IntegerDigits[#], {0, 2, 3, 5, 6, 8, 9}]] == {0, 2, 3, 5, 6, 8, 9} &] (* RGWv *) %t A034470 Select[Prime[Range[500]], Intersection[IntegerDigits[#], {1, 4, 7}] == {} &] (* _K. D. Bajpai_, Sep 07 2014 *) %Y A034470 Cf. A028374, A072960, A079652. %K A034470 base,nonn %O A034470 1,1 %A A034470 _Robert G. Wilson v_, Jan 24 2003