cp's OEIS Frontend

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.

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.

Table of values

n a(n)
1 1
2 3
3 3
4 7
5 9
6 9
7 13
8 15
9 9
10 19
11 39
12 39
13 79
14 99
15 99
16 139
17 159
18 99
19 199
20 399
21 399
22 799
23 999
24 999
25 1399
26 1599
27 999
28 1999
29 3999
30 3999
31 7999
32 9999
33 9999
34 13999
35 15999
36 9999
37 19999
38 39999
39 39999
40 79999
41 99999
42 99999
43 139999
44 159999
45 99999
46 199999
47 399999
48 399999
49 799999

List of values

[1, 3, 3, 7, 9, 9, 13, 15, 9, 19, 39, 39, 79, 99, 99, 139, 159, 99, 199, 399, 399, 799, 999, 999, 1399, 1599, 999, 1999, 3999, 3999, 7999, 9999, 9999, 13999, 15999, 9999, 19999, 39999, 39999, 79999, 99999, 99999, 139999, 159999, 99999, 199999, 399999, 399999, 799999]