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 A274319 #17 Aug 18 2016 12:18:47
%S A274319 0,6,15,24,33,39,42,48,51,57,60,66,75,84,93,99,105,114,123,129,132,
%T A274319 138,141,147,150,156,165,174,183,189,192,198,204,213,219,222,228,231,
%U A274319 237,240,246,255,264,273,279,282,288,291,297,303,309,312,318,321,327,330,336,345,354,363,369,372,378,381
%N A274319 Numbers whose digit sum is divisible by 6.
%C A274319 Numbers n such that A007953(n) is a term of A008588. - _Felix Fröhlich_, Aug 18 2016
%C A274319 Any term of the sequence is also a term of A008585. - _Felix Fröhlich_, Aug 18 2016
%o A274319 (C)
%o A274319 int i = 0;
%o A274319 while(1){
%o A274319 int sum = 0;
%o A274319 int powerof10 = 10;
%o A274319 int i2 = i;
%o A274319 while(i2 != 0){
%o A274319 sum += i2%powerof10;
%o A274319 i2 /= 10;
%o A274319 powerof10 *= 10;
%o A274319 }
%o A274319 if(sum%6 == 0) printf("%d\n", i);
%o A274319 i++;
%o A274319 }
%o A274319 (PARI) is(n)=my(d=digits(n));sum(k=1,#d,d[n])%6==0; \\ _Joerg Arndt_, Aug 18 2016
%o A274319 (PARI) is(n)=sumdigits(n)%6==0 \\ _Charles R Greathouse IV_, Aug 18 2016
%Y A274319 Cf. A007953.
%K A274319 base,nonn,easy
%O A274319 1,2
%A A274319 _Elana Lessing_, Jun 17 2016