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 A341009 #23 Feb 23 2021 11:42:24 %S A341009 8,17,26,35,44,53,62,71,80,107,129,170,192,206,219,224,237,242,255, %T A341009 260,273,291,305,327,349,350,372,394,404,422,439,440,457,475,493,503, %U A341009 525,530,547,552,569,574,596,602,620,659,677,695,701,710,723,732,745,754,767,776,789 %N A341009 Numbers whose sum of even digits and sum of odd digits differ by 8. %H A341009 Carole Dubois, <a href="/A341009/b341009.txt">Table of n, a(n) for n = 1..5001</a> %t A341009 Select[Range[1000], Abs[Plus @@ Select[(d = IntegerDigits[#]), OddQ] - Plus @@ Select[d, EvenQ]] == 8 &] (* _Amiram Eldar_, Feb 02 2021 *) %o A341009 (Python) %o A341009 def eodiff(n): %o A341009 digs = list(map(int, str(n))) %o A341009 return abs(sum(d for d in digs if d%2==0)-sum(d for d in digs if d%2==1)) %o A341009 def aupto(lim): return [m for m in range(lim+1) if eodiff(m) == 8] %o A341009 print(aupto(789)) # _Michael S. Branicky_, Feb 21 2021 %Y A341009 Cf. A009994, A036301 (sums are equal), A341002 to A341010 (sums differ by 1 to 9). %K A341009 base,nonn %O A341009 1,1 %A A341009 _Eric Angelini_ and _Carole Dubois_, Feb 02 2021