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 A096844 #27 Mar 20 2023 09:08:17 %S A096844 0,10,30,50,70,90,100,101,103,105,107,109,110,130,150,170,190,300,301, %T A096844 303,305,307,309,310,330,350,370,390,500,501,503,505,507,509,510,530, %U A096844 550,570,590,700,701,703,705,707,709,710,730,750,770,790,900,901,903,905 %N A096844 Numbers where 0 is the only even decimal digit. %C A096844 This is a regular language in base 10. - _Charles R Greathouse IV_, Oct 05 2011 %H A096844 Harvey P. Dale, <a href="/A096844/b096844.txt">Table of n, a(n) for n = 1..1000</a> %H A096844 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a> %t A096844 Select[Range[0,1000],DigitCount[#,10,0]>0&&AllTrue[DeleteCases[IntegerDigits[ #],0],OddQ]&] (* _Harvey P. Dale_, Mar 20 2023 *) %o A096844 (Perl) for (0..1000) { %o A096844 print "$_, " if (/^[013579]*0[013579]*$/) %o A096844 } # _Charles R Greathouse IV_, Oct 05 2011 %o A096844 (Python) %o A096844 from itertools import product %o A096844 def agen(maxdigits): %o A096844 yield 0 %o A096844 for digs in range(2, maxdigits+1): %o A096844 for p in product("013579", repeat=digs): %o A096844 if p[0] != '0' and '0' in p: yield int("".join(p)) %o A096844 print([an for an in agen(3)]) # _Michael S. Branicky_, Jun 26 2021 %Y A096844 Cf. A276137 (allowing no 0 digits). %Y A096844 Cf. A098941 (2), A098942 (4), A098943 (6), A098944 (8). %Y A096844 Cf. A098945 (1), A098946 (3), A098947 (5), A098948 (7), A098949 (9). %K A096844 base,easy,nonn %O A096844 1,2 %A A096844 _Eric Angelini_, Oct 21 2004 %E A096844 a(50)=790 inserted by _Georg Fischer_, Jun 26 2021