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 A285846 #27 Feb 27 2019 01:18:41
%S A285846 7,37,237,1789,4357,14379,19587,93957,189572,189597,1234397,1839597,
%T A285846 1958798,1983957,3978594,11983957,19596487,29195397,39599197,
%U A285846 195991487,339799143,395991697,1429199397,1679895983,1983994799,2239951987,11959939917,15991995897
%N A285846 A039938 with duplicates removed.
%C A285846 Any proof that this sequence is infinite?
%C A285846 This sequence is infinite because A039938 is indeed infinite and for any number k there is a multiple of k which does not contain a '7', so A039938 contains infinitely many distinct terms. Both parts are easy to prove. - _Giovanni Resta_, Feb 26 2019
%H A285846 Giovanni Resta, <a href="/A285846/b285846.txt">Table of n, a(n) for n = 1..32</a>
%t A285846 Union@ Table[SelectFirst[Range[10^6], Times @@ Boole@ Map[DigitCount[#, 10, 7] > 0 &, # Range@ n] > 0 &], {n, 12}] (* _Michael De Vlieger_, Apr 27 2017, Version 10 *)
%Y A285846 Cf. A039938.
%Y A285846 Subsequence of A011537.
%K A285846 nonn,base
%O A285846 1,1
%A A285846 _J. Lowell_, Apr 27 2017
%E A285846 a(19)-a(28) from _Giovanni Resta_, Apr 27 2017