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 A302599 #23 Apr 12 2018 02:41:08
%S A302599 5,6,7,8,15,16,17,25,26,35,50,51,52,53,55,56,57,58,59,60,61,62,65,66,
%T A302599 67,68,69,70,71,75,76,77,78,79,80,85,86,87,88,89,95,96,97,98,105,106,
%U A302599 107,115,116,125,150,151,152,155,156,157,158,159,160,161,165,166
%N A302599 Numbers k such that digit_sum(k) > digit_sum(2k).
%C A302599 Conjecture: a(n) ~ 2n. - _Charles R Greathouse IV_, Apr 10 2018
%C A302599 If n is in the sequence then so is 10*n. - _David A. Corneth_, Apr 10 2018
%C A302599 a(10^9) = 2367976531. - _Charles R Greathouse IV_, Apr 11 2018
%H A302599 Robert Israel, <a href="/A302599/b302599.txt">Table of n, a(n) for n = 1..10000</a>
%e A302599 17 is in this sequence because 1+7 > 3+4.
%p A302599 select(t -> convert(convert(2*t,base,10),`+`)<convert(convert(t,base,10),`+`), [$1..1000]); # _Robert Israel_, Apr 12 2018
%t A302599 With[{s = Array[Total@ IntegerDigits@ # &, 332]}, Select[Range@ Floor[Length[s]/2], s[[#]] > s[[2 #]] &]] (* _Michael De Vlieger_, Apr 10 2018 *)
%o A302599 (Python)
%o A302599 print([y for y in range(10000) if sum([int(x) for x in str(y)]) > sum([int(z) for z in str(2*y)])])
%o A302599 (PARI) is(n)=sumdigits(n)>sumdigits(2*n) \\ _Charles R Greathouse IV_, Apr 10 2018
%Y A302599 Cf. A004092, A007953, A070279.
%K A302599 nonn,base,easy
%O A302599 1,1
%A A302599 _David Consiglio, Jr._, Apr 10 2018