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.

A332584 a(n) = minimal value of n+k (with k >= 1) 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 n+k exists.

Table of values

n a(n)
1 2
2 82
3 1888
4 6842
5 6
6 50
7 20
8 10
9 1320
10 28
11 208
12 32
13 66
14 148
15 1008
16 60
17 192
18 124536
19 282
20 46
21 128
22 32
23 28
24 86
25 40
26 33198
27 36
28 42
29 346
30 738
31 1532
32 246
33 70
34 68
35 102
36 306
37 56
38 20226
39 78316
40 10778
41 328
42 2432
43 738
44 2783191412956
45 48
46 746
47 8350
48 398
49 70
50 150
51 2300
52 21378

List of values

[2, 82, 1888, 6842, 6, 50, 20, 10, 1320, 28, 208, 32, 66, 148, 1008, 60, 192, 124536, 282, 46, 128, 32, 28, 86, 40, 33198, 36, 42, 346, 738, 1532, 246, 70, 68, 102, 306, 56, 20226, 78316, 10778, 328, 2432, 738, 2783191412956, 48, 746, 8350, 398, 70, 150, 2300, 21378]