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.

A184218 a(n) = largest k such that A000217(n+1) = A000217(n) + (A000217(n) mod k), or 0 if no such k exists.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 9
6 14
7 20
8 27
9 35
10 44
11 54
12 65
13 77
14 90
15 104
16 119
17 135
18 152
19 170
20 189
21 209
22 230
23 252
24 275
25 299
26 324
27 350
28 377
29 405
30 434
31 464
32 495
33 527
34 560
35 594
36 629
37 665
38 702
39 740
40 779
41 819
42 860
43 902
44 945
45 989
46 1034
47 1080
48 1127
49 1175
50 1224
51 1274
52 1325
53 1377

List of values

[0, 0, 0, 0, 9, 14, 20, 27, 35, 44, 54, 65, 77, 90, 104, 119, 135, 152, 170, 189, 209, 230, 252, 275, 299, 324, 350, 377, 405, 434, 464, 495, 527, 560, 594, 629, 665, 702, 740, 779, 819, 860, 902, 945, 989, 1034, 1080, 1127, 1175, 1224, 1274, 1325, 1377]