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 A072960 #27 May 01 2018 09:29:13
%S A072960 0,3,6,8,9,30,33,36,38,39,60,63,66,68,69,80,83,86,88,89,90,93,96,98,
%T A072960 99,300,303,306,308,309,330,333,336,338,339,360,363,366,368,369,380,
%U A072960 383,386,388,389,390,393,396,398,399,600,603,606,608,609,630,633,636,638
%N A072960 Numbers using only the curved digits 0, 3, 6, 8 and 9.
%C A072960 Exponential density 0.69897... = log 5/log 10. A 10-automatic sequence. - _Charles R Greathouse IV_, Jul 22 2012
%D A072960 M. J. Halm, Three Boxes, Puzzle-M Magazine (Apr. 1987).
%H A072960 Seiichi Manyama, <a href="/A072960/b072960.txt">Table of n, a(n) for n = 1..1000</a>
%H A072960 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%t A072960 f[n_] := Block[{id = IntegerDigits[n], curve = {0, 3, 6, 8, 9}}, If[ Union[ Join[id, curve]] == curve, True, False]]; Select[ Range[0, 240], f[ # ] & ]
%t A072960 FromDigits/@Tuples[{0,3,6,8,9},3] (* _Harvey P. Dale_, May 01 2018 *)
%o A072960 (PARI) isok(n)= my(d = Set(digits(n))); for (k=1, #d, if (vecsearch([1,2,4,5,7],d[k]), return (0))); 1; \\ _Michel Marcus_, May 11 2016
%o A072960 (Python)
%o A072960 from itertools import product
%o A072960 A072960_list = [0] + [int(a+''.join(b)) for l in range(5) for a in '3689' for b in product('03689',repeat=l)] # _Chai Wah Wu_, May 12 2016
%K A072960 easy,nonn,base
%O A072960 1,2
%A A072960 _Michael Joseph Halm_, Aug 13 2002
%E A072960 Corrected by _Rick L. Shepherd_, Aug 13 2002
%E A072960 Offset corrected by _Arkadiusz Wesolowski_, Aug 15 2011