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.

A184728 a(n) = largest 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 8
4 6
5 13
6 9
7 20
8 19
9 24
10 19
11 32
12 33
13 32
14 37
15 32
16 43
17 47
18 47
19 53
20 56
21 54
22 59
23 61
24 64
25 71
26 72
27 79
28 84
29 85
30 83
31 89
32 92
33 93
34 84
35 101
36 107
37 112
38 117
39 117
40 120
41 121
42 117
43 125
44 132
45 127
46 140
47 141
48 141
49 144
50 137
51 152
52 157
53 157

List of values

[0, 0, 8, 6, 13, 9, 20, 19, 24, 19, 32, 33, 32, 37, 32, 43, 47, 47, 53, 56, 54, 59, 61, 64, 71, 72, 79, 84, 85, 83, 89, 92, 93, 84, 101, 107, 112, 117, 117, 120, 121, 117, 125, 132, 127, 140, 141, 141, 144, 137, 152, 157, 157]