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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 4
5 5
6 4
7 9
8 9
9 12
10 13
11 13
12 15
13 17
14 20
15 21
16 20
17 23
18 28
19 29
20 29
21 32
22 33
23 33
24 36
25 37
26 37
27 40
28 41
29 40
30 45
31 43
32 49
33 51
34 53
35 56
36 57
37 57
38 60
39 59
40 64
41 65
42 65
43 68
44 69
45 69
46 72
47 71
48 76
49 77
50 76
51 81
52 81
53 84
54 85
55 85
56 87
57 89
58 92
59 93
60 93
61 93
62 100
63 101
64 101
65 104
66 105

List of values

[0, 0, 0, 4, 5, 4, 9, 9, 12, 13, 13, 15, 17, 20, 21, 20, 23, 28, 29, 29, 32, 33, 33, 36, 37, 37, 40, 41, 40, 45, 43, 49, 51, 53, 56, 57, 57, 60, 59, 64, 65, 65, 68, 69, 69, 72, 71, 76, 77, 76, 81, 81, 84, 85, 85, 87, 89, 92, 93, 93, 93, 100, 101, 101, 104, 105]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.