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 A007958 #22 Oct 12 2021 07:56:39
%S A007958 10,12,14,16,18,30,32,34,36,38,50,52,54,56,58,70,72,74,76,78,90,92,94,
%T A007958 96,98,100,102,104,106,108,110,112,114,116,118,120,122,124,126,128,
%U A007958 130,132,134,136,138,140,142,144,146,148,150,152,154,156,158,160,162
%N A007958 Even numbers with at least one odd digit.
%C A007958 Old name was: Even numbers such that some permutation of digits is an odd number.
%C A007958 a(n) = A179083(n) for n <= 30. - _Reinhard Zumkeller_, Jun 28 2010
%H A007958 Michael S. Branicky, <a href="/A007958/b007958.txt">Table of n, a(n) for n = 1..10000</a>
%H A007958 F. Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/OPNS.pdf">Only Problems, Not Solutions!</a>
%H A007958 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%F A007958 a(n) ~ 2n. - _Charles R Greathouse IV_, Oct 23 2015
%t A007958 Select[2*Range[100],Or@@OddQ[IntegerDigits[#]]&] (* _Harvey P. Dale_, Apr 01 2013 *)
%o A007958 (PARI) is(n)=n%2==0 && vecsum(Set(digits(n)%2)) \\ _Charles R Greathouse IV_, Oct 23 2015
%o A007958 (Python)
%o A007958 def ok(n): return n%2 == 0 and set(str(n)) & set("13579") != set()
%o A007958 print(list(filter(ok, range(163)))) # _Michael S. Branicky_, Oct 12 2021
%K A007958 nonn,base,easy
%O A007958 1,1
%A A007958 R. Muller
%E A007958 New name from _Charles R Greathouse IV_, Feb 14 2017, based on comment from _Harvey P. Dale_, Apr 01 2013