%I #11 Aug 20 2021 04:30:49
%S 8,19,80,91,107,118,129,190,206,217,228,239,305,316,327,338,349,404,
%T 415,426,437,448,459,503,514,525,536,547,558,569,602,613,624,635,646,
%U 657,668,679,701,712,723,734,745,756,767,778,789,800,811,822,833,844,855
%N |First digit - second digit + third digit - fourth digit ...| = 8.
%H Harvey P. Dale, <a href="/A061877/b061877.txt">Table of n, a(n) for n = 1..1000</a>
%t Do[ a = IntegerDigits[ n ]; l = Length[ a ]; e = o = {}; Do[ o = Append[ o, a[[ 2k - 1 ]]], {k, 1, l/2 + .5} ]; Do[ e = Append[ e, a[[ 2k ] ]], {k, 1, l/2} ]; If[ Abs[ Apply[ Plus, o ] - Apply[ Plus, e ]] == 8, Print[ n ]], {n, 1, 1000} ]
%t Select[Range[1000],Abs[Total[Times@@@Partition[Riffle[IntegerDigits[#],{1,-1},{2,-1,2}],2]]]==8&] (* _Harvey P. Dale_, Jan 28 2019 *)
%o (Python)
%o def ok(n): return abs(sum((-1)**i*int(d) for i, d in enumerate(str(n))))==8
%o print(list(filter(ok, range(860)))) # _Michael S. Branicky_, Aug 19 2021
%Y Cf. A008593, A060978-A060980, A060982, A061470-A061479, A061870-A061882.
%K nonn,base,easy
%O 1,1
%A _Robert G. Wilson v_, May 10 2001