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.

A331786 a(n) is the largest m such that there exists N such that none 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 0
2 2
3 2
4 6
5 8
6 8
7 12
8 14
9 8
10 18
11 38
12 38
13 78
14 98
15 98
16 138
17 158
18 98
19 198
20 398
21 398
22 798
23 998
24 998
25 1398
26 1598
27 998
28 1998
29 3998
30 3998
31 7998
32 9998
33 9998
34 13998
35 15998
36 9998
37 19998
38 39998
39 39998
40 79998
41 99998
42 99998
43 139998
44 159998
45 99998
46 199998
47 399998
48 399998
49 799998

List of values

[0, 2, 2, 6, 8, 8, 12, 14, 8, 18, 38, 38, 78, 98, 98, 138, 158, 98, 198, 398, 398, 798, 998, 998, 1398, 1598, 998, 1998, 3998, 3998, 7998, 9998, 9998, 13998, 15998, 9998, 19998, 39998, 39998, 79998, 99998, 99998, 139998, 159998, 99998, 199998, 399998, 399998, 799998]