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 A333834 #16 Apr 07 2020 15:42:42 %S A333834 190,280,370,460,550,640,730,820,910,1090,1180,1270,1360,1450,1540, %T A333834 1630,1720,1810,1900,2080,2170,2260,2350,2440,2530,2620,2710,2800, %U A333834 3070,3160,3250,3340,3430,3520,3610,3700,4060,4150,4240,4330,4420,4510 %N A333834 Multiples of 10 whose sum of digits is 10. %C A333834 If m is a term, 10*m is also a term. %C A333834 Intersection of A052224 (sum of digits = 10) and A008592 (multiples of 10). %F A333834 a(n) = 10*A052224(n). - _Charles R Greathouse IV_, Apr 07 2020 %e A333834 2440 = 10 * 244 and 2 + 4 + 4 + 0 = 10, hence 2440 is a term. %t A333834 Select[10 * Range[500], Plus @@ IntegerDigits[#] == 10 &] (* _Amiram Eldar_, Apr 07 2020 *) %Y A333834 Multiples of k whose sum of digits = k: A011557 (k=1), A069537 (k=2), A052217 (k=3), A063997 (k=4), A069540 (k=5), A062768 (k=6), A063416 (k=7), A069543 (k=8), A052223 (k=9), this sequence (k=10), A283742 (k=11), A333814 (k=12), A283737 (k=13). %Y A333834 Subsequence of A218292. %Y A333834 Cf. A008592 (multiples of 10), A052224 (sum of digits = 10). %Y A333834 Cf. A057147 (a(n) = n times sum of digits of n) %K A333834 nonn,base,easy %O A333834 1,1 %A A333834 _Bernard Schott_, Apr 07 2020