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.

A130533 a(n) = smallest k such that A001358(n+1) = A001358(n) + (A001358(n) mod k), or 0 if no such k exists.

Table of values

n a(n)
1 0
2 0
3 2
4 6
5 13
6 9
7 2
8 19
9 2
10 19
11 2
12 3
13 4
14 37
15 8
16 43
17 47
18 47
19 53
20 2
21 6
22 59
23 61
24 8
25 71
26 6
27 79
28 2
29 5
30 83
31 89
32 2
33 3
34 12
35 101
36 107
37 4
38 3
39 3
40 2
41 11

List of values

[0, 0, 2, 6, 13, 9, 2, 19, 2, 19, 2, 3, 4, 37, 8, 43, 47, 47, 53, 2, 6, 59, 61, 8, 71, 6, 79, 2, 5, 83, 89, 2, 3, 12, 101, 107, 4, 3, 3, 2, 11]