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 A216994 #18 Feb 18 2013 01:00:26
%S A216994 7,70,77,133,266,322,329,392,399,455,511,518,581,588,644,700,707,770,
%T A216994 777,833,966,1015,1085,1141,1148,1204,1274,1330,1337,1463,1526,1596,
%U A216994 1652,1659,1715,1785,1841,1848,1904,1974,2023,2093,2156,2212,2219,2282,2289
%N A216994 Multiples of 7 such that the digit sum is divisible by 7.
%C A216994 Conjecture: Every century has a representation in the sequence.
%e A216994 1085 = 7*155 and 1 + 0 + 8 + 5 = 14 = 7*2.
%t A216994 Select[7*Range[400], Mod[Total[IntegerDigits[#]], 7] == 0 &] (* _T. D. Noe_, Sep 24 2012 *)
%o A216994 (JavaScript)
%o A216994 function sumarray(arr) {
%o A216994 t = 0;
%o A216994 for (i = 0; i < arr.length; i++) t += arr[i];
%o A216994 return t;
%o A216994 }
%o A216994 for(s = 7; s < 3000; s += 7) {
%o A216994 a = new Array();
%o A216994 x = s.toString();
%o A216994 for (j = 0; j < x.length; j++) a[j] = Number(x.charAt(j));
%o A216994 if (sumarray(a) % 7 == 0) document.write(s + ",");
%o A216994 }
%Y A216994 Cf. A216995, A216996, A216997, A216998, A217009.
%K A216994 nonn,base
%O A216994 1,1
%A A216994 _Jon Perry_, Sep 22 2012