A094677 Sum of digits is divisible by 10.

19, 28, 37, 46, 55, 64, 73, 82, 91, 109, 118, 127, 136, 145, 154, 163, 172, 181, 190, 208, 217, 226, 235, 244, 253, 262, 271, 280, 299, 307, 316, 325, 334, 343, 352, 361, 370, 389, 398, 406, 415, 424, 433, 442, 451, 460, 479, 488, 497, 505, 514, 523, 532, 541

Offset: 1

Author

Benoit Cloitre, Jun 07 2004

Keywords

• base
• nonn
• easy

Comments

a(n) = A052224(n) for n = 1..28. - Reinhard Zumkeller, Nov 08 2015

A syndetic set: a(n+1) - a(n) <= 19. (This gap size occurs infinitely often.) - Charles R Greathouse IV, Oct 13 2022

Examples

			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
		

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A007953, A052224.

Programs

Haskell

a094677 n = a094677_list !! (n-1)
a094677_list = filter ((== 0) . flip mod 10 . a007953) [1..]
-- Reinhard Zumkeller, Nov 08 2015

Mathematica

a[ n_] := If[ n < 1, 0, 10 n + Mod[-Total@IntegerDigits[n], 10]]; (* Michael Somos, Jun 09 2019 *)

PARI

isok(n) = !(sumdigits(n) % 10); \\ Michel Marcus, Dec 07 2013

PARI

{a(n) = if( n<1, 0, 10*n + (-sumdigits(n))%10)}; /* Michael Somos, Jun 09 2019 */

Formula

a(n)=10n+r(n) where r(n) takes values in {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}.