a(n) is the smallest m such that for any N, at least one of S(N), S(N+1), ..., S(N+m-1) is divisible by n, where S(N) is the sum of digits of N.

A331788

a(n) is the smallest m such that for any N, at least one of S(N), S(N+1), ..., S(N+m-1) is divisible by n, where S(N) is the sum of digits of N.

Terms

    a(0) =1a(1) =3a(2) =3a(3) =7a(4) =9a(5) =9a(6) =13a(7) =15a(8) =9a(9) =19a(10) =39a(11) =39a(12) =79a(13) =99a(14) =99a(15) =139a(16) =159a(17) =99a(18) =199a(19) =399a(20) =399a(21) =799a(22) =999a(23) =999a(24) =1399a(25) =1599a(26) =999a(27) =1999a(28) =3999a(29) =3999

External references