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 A011537 #29 Jul 23 2021 10:16:37 %S A011537 7,17,27,37,47,57,67,70,71,72,73,74,75,76,77,78,79,87,97,107,117,127, %T A011537 137,147,157,167,170,171,172,173,174,175,176,177,178,179,187,197,207, %U A011537 217,227,237,247,257,267,270,271,272,273,274,275,276,277,278,279,287 %N A011537 Numbers that contain at least one 7. %C A011537 Subsequence of primes is A257668. - _Bernard Schott_, Jul 21 2021 %H A011537 Muniru A Asiru, <a href="/A011537/b011537.txt">Table of n, a(n) for n = 1..5000</a> %H A011537 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>. %F A011537 a(n) ~ n. - _Charles R Greathouse IV_, Feb 12 2017 %t A011537 Select[Range[300],DigitCount[#,10,7]>0&] (* _Harvey P. Dale_, Mar 29 2016 *) %o A011537 (PARI) is(n)=!!setsearch(Set(digits(n)), 7) \\ _Charles R Greathouse IV_, Feb 12 2017 %o A011537 (GAP) Filtered([1..280],n->7 in ListOfDigits(n)); # _Muniru A Asiru_, Feb 23 2019 %o A011537 (Python) %o A011537 def ok(n): return '7' in str(n) %o A011537 print(list(filter(ok, range(290)))) # _Michael S. Branicky_, Jul 17 2021 %Y A011537 Complement of A052419. %Y A011537 Cf. A257668. %K A011537 nonn,base,easy %O A011537 1,1 %A A011537 _N. J. A. Sloane_