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 A218292 #16 Sep 08 2022 08:46:04 %S A218292 190,280,370,460,550,640,730,820,910,1090,1180,1270,1360,1450,1540, %T A218292 1630,1720,1810,1900,2080,2170,2260,2350,2440,2530,2620,2710,2800, %U A218292 2990,3070,3160,3250,3340,3430,3520,3610,3700,3890,3980,4060,4150,4240,4330,4420,4510 %N A218292 Multiples of 10 such that the sum of their digits is also a multiple of 10. %H A218292 Bruno Berselli, <a href="/A218292/b218292.txt">Table of n, a(n) for n = 1..1000</a> %F A218292 a(n) = 10*A094677(n). %e A218292 a(38) = 3890 is a multiple of 10, and 3+8+9+0=20 is also a multiple of 10. %t A218292 Select[ Range[10, 4600, 10], Mod[ Total[ IntegerDigits[#]], 10] == 0 &] (* _Jean-François Alcover_, Oct 26 2012 *) %o A218292 (Magma) [n: n in [10..4600 by 10] | IsZero(&+Intseq(n) mod 10)]; %Y A218292 Cf. multiples of k with digit sum divisible by k: A008585 (k=3), A008591 (k=9), A062753 (k=4), A179082 (k=2), A216994 (k=7), A216995 (k=11), A216997 (k=8), A218290 (k=5), A218291 (k=6). %K A218292 nonn,base,easy %O A218292 1,1 %A A218292 _Bruno Berselli_, Oct 25 2012