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 A094677 #21 Oct 13 2022 11:42:13
%S A094677 19,28,37,46,55,64,73,82,91,109,118,127,136,145,154,163,172,181,190,
%T A094677 208,217,226,235,244,253,262,271,280,299,307,316,325,334,343,352,361,
%U A094677 370,389,398,406,415,424,433,442,451,460,479,488,497,505,514,523,532,541
%N A094677 Sum of digits is divisible by 10.
%C A094677 a(n) = A052224(n) for n = 1..28. - _Reinhard Zumkeller_, Nov 08 2015
%C A094677 A syndetic set: a(n+1) - a(n) <= 19. (This gap size occurs infinitely often.) - _Charles R Greathouse IV_, Oct 13 2022
%H A094677 Reinhard Zumkeller, <a href="/A094677/b094677.txt">Table of n, a(n) for n = 1..10000</a>
%F A094677 a(n)=10n+r(n) where r(n) takes values in {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}.
%e A094677 G.f. = 19*x + 28*x^2 + 37*x^3 + 46*x^4 + 55*x^5 + 64*x^6 + 73*x^7 + 82*x^8 + ... - _Michael Somos_, Jun 09 2019
%t A094677 a[ n_] := If[ n < 1, 0, 10 n + Mod[-Total@IntegerDigits[n], 10]]; (* _Michael Somos_, Jun 09 2019 *)
%o A094677 (PARI) isok(n) = !(sumdigits(n) % 10); \\ _Michel Marcus_, Dec 07 2013
%o A094677 (PARI) {a(n) = if( n<1, 0, 10*n + (-sumdigits(n))%10)}; /* _Michael Somos_, Jun 09 2019 */
%o A094677 (Haskell)
%o A094677 a094677 n = a094677_list !! (n-1)
%o A094677 a094677_list = filter ((== 0) . flip mod 10 . a007953) [1..]
%o A094677 -- _Reinhard Zumkeller_, Nov 08 2015
%Y A094677 Cf. A007953, A052224.
%K A094677 base,nonn,easy
%O A094677 1,1
%A A094677 _Benoit Cloitre_, Jun 07 2004