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.

A184750 a(n) = largest k such that A000326(n+1) = A000326(n) + (A000326(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 19
6 32
7 48
8 67
9 89
10 114
11 142
12 173
13 207
14 244
15 284
16 327
17 373
18 422
19 474
20 529
21 587
22 648
23 712
24 779
25 849
26 922
27 998
28 1077
29 1159
30 1244
31 1332
32 1423
33 1517
34 1614
35 1714
36 1817
37 1923
38 2032
39 2144
40 2259
41 2377
42 2498
43 2622
44 2749

List of values

[0, 0, 0, 0, 19, 32, 48, 67, 89, 114, 142, 173, 207, 244, 284, 327, 373, 422, 474, 529, 587, 648, 712, 779, 849, 922, 998, 1077, 1159, 1244, 1332, 1423, 1517, 1614, 1714, 1817, 1923, 2032, 2144, 2259, 2377, 2498, 2622, 2749]