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.

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

Table of values

n a(n)
1 0
2 0
3 5
4 5
5 11
6 9
7 17
8 19
9 29
10 29
11 31
12 37
13 47
14 13
15 59
16 5
17 5
18 71
19 71
20 71
21 9
22 29
23 31
24 9
25 107
26 103
27 5
28 5
29 131
30 43
31 131
32 11
33 5
34 157
35 167
36 51
37 5
38 191
39 7
40 197
41 199
42 29
43 5
44 43
45 227
46 233
47 233
48 223
49 257
50 15
51 9
52 263
53 281
54 281
55 281
56 97
57 13
58 59
59 317
60 7
61 17
62 17
63 47
64 11
65 353
66 71
67 349
68 379
69 389

List of values

[0, 0, 5, 5, 11, 9, 17, 19, 29, 29, 31, 37, 47, 13, 59, 5, 5, 71, 71, 71, 9, 29, 31, 9, 107, 103, 5, 5, 131, 43, 131, 11, 5, 157, 167, 51, 5, 191, 7, 197, 199, 29, 5, 43, 227, 233, 233, 223, 257, 15, 9, 263, 281, 281, 281, 97, 13, 59, 317, 7, 17, 17, 47, 11, 353, 71, 349, 379, 389]