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 A269314 #11 May 22 2019 21:01:57 %S A269314 15,24,30,39,48,57,66,75,84,93,96,99,108,138,147,189,198,207,228,249, %T A269314 258,288,309,321,351,372,378,402,414,456,465,507,600,612,633,645,705, %U A269314 801,813,930,1902,1911,1962,1992,2010,2013,2028,2037,2052,2076,2085,2100,2103 %N A269314 Numbers x that are the sum of the digits of k consecutive numbers starting from x+1. %C A269314 All terms are multiples of 3. %H A269314 Paolo P. Lava, <a href="/A269314/b269314.txt">Table of n, a(n) for n = 1..1000</a> %e A269314 15 = 1+6 + 1+7; %e A269314 24 = 2+5 + 2+6 + 2+7; %e A269314 30 = 3+1 + 3+2 + 3+3 + 3+4 + 3+5. %p A269314 P:= proc(q) local a,b,c,k,n; for n from 1 to q do a:=0; b:=0; %p A269314 while a<n do b:=b+1; c:=n+b; for k from 1 to ilog10(n+b)+1 do a:=a+(c mod 10); c:=trunc(c/10); %p A269314 od; od; if a=n then print(n); fi; od; end: P(10^6); %t A269314 Select[Range[2100], (x = # + 1; s = Total[IntegerDigits[x]]; While[s < #, x++; s += Total[IntegerDigits[x]]]; s == #) &] (* _Robert Price_, May 22 2019 *) %Y A269314 Cf. A269315. %K A269314 nonn,base,easy %O A269314 1,1 %A A269314 _Paolo P. Lava_, Feb 25 2016