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.

A332580 a(n) = minimal positive k such that the concatenation of the decimal digits of n,n+1,...,n+k is divisible by n+k+1, or -1 if no such k exists.

Table of values

n a(n)
1 1
2 80
3 1885
4 6838
5 1
6 44
7 13
8 2
9 1311
10 18
11 197
12 20
13 53
14 134
15 993
16 44
17 175
18 124518
19 263
20 26
21 107
22 10
23 5
24 62
25 15
26 33172
27 9
28 14
29 317
30 708
31 1501
32 214
33 37
34 34
35 67
36 270
37 19
38 20188
39 78277
40 10738
41 287
42 2390
43 695
44 2783191412912
45 3
46 700
47 8303
48 350
49 21
50 100
51 2249
52 21326

List of values

[1, 80, 1885, 6838, 1, 44, 13, 2, 1311, 18, 197, 20, 53, 134, 993, 44, 175, 124518, 263, 26, 107, 10, 5, 62, 15, 33172, 9, 14, 317, 708, 1501, 214, 37, 34, 67, 270, 19, 20188, 78277, 10738, 287, 2390, 695, 2783191412912, 3, 700, 8303, 350, 21, 100, 2249, 21326]