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 A069532 #29 Sep 15 2020 20:47:58
%S A069532 10,2,12,4,14,6,16,8,18,28,38,48,58,68,78,88,98,198,298,398,498,598,
%T A069532 698,798,898,998,1998,2998,3998,4998,5998,6998,7998,8998,9998,19998,
%U A069532 29998,39998,49998,59998,69998,79998,89998,99998,199998,299998,399998,499998
%N A069532 Smallest even number with digit sum n.
%H A069532 Chai Wah Wu, <a href="/A069532/b069532.txt">Table of n, a(n) for n = 1..8999</a>
%H A069532 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,10,-10).
%F A069532 From _Chai Wah Wu_, Sep 15 2020: (Start)
%F A069532 a(n) = a(n-1) + 10*a(n-9) - 10*a(n-10) for n > 17.
%F A069532 G.f.: 2*x*(45*x^16 - 45*x^15 + 45*x^14 - 45*x^13 + 45*x^12 - 45*x^11 + 45*x^10 - 45*x^9 + 5*x^8 - 4*x^7 + 5*x^6 - 4*x^5 + 5*x^4 - 4*x^3 + 5*x^2 - 4*x + 5)/((x - 1)*(10*x^9 - 1)). (End)
%F A069532 a(n) = 2 * A077491(n). - _Alois P. Heinz_, Sep 15 2020
%t A069532 t={}; Do[i=2; While[Total[IntegerDigits[i]]!=n,i=i+2]; AppendTo[t,i],{n,48}]; t (* _Jayanta Basu_, May 18 2013 *)
%o A069532 (PARI) a(n) = {my(k = 2); while(sumdigits(k) != n, k+=2); k;} \\ _Michel Marcus_, Mar 18 2016
%Y A069532 Cf. A069521 to A069530.
%Y A069532 Cf. A000918 (smallest even number with bit sum n), A051885 (smallest number with digit sum n).
%Y A069532 Cf. A077491.
%K A069532 base,nonn,easy
%O A069532 1,1
%A A069532 _Amarnath Murthy_, Apr 01 2002
%E A069532 More terms from _Ray Chandler_, Jul 28 2003