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.

A184832 a(n) = smallest 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 2
5 5
6 4
7 3
8 3
9 2
10 13
11 13
12 3
13 17
14 2
15 3
16 4
17 23
18 2
19 29
20 29
21 2
22 3
23 3
24 2
25 37
26 37
27 2
28 41
29 4
30 3
31 43
32 7
33 3
34 53
35 2
36 3
37 3
38 2
39 59
40 2
41 5
42 5
43 2
44 3
45 3
46 2
47 71
48 2
49 7
50 4
51 3
52 3
53 2
54 5
55 5
56 3
57 89
58 2
59 3
60 3
61 31
62 2
63 101
64 101
65 2
66 3
67 3
68 2
69 109
70 109
71 2
72 113
73 4
74 3
75 4
76 11
77 7
78 5
79 2
80 3
81 3
82 2

List of values

[0, 0, 0, 2, 5, 4, 3, 3, 2, 13, 13, 3, 17, 2, 3, 4, 23, 2, 29, 29, 2, 3, 3, 2, 37, 37, 2, 41, 4, 3, 43, 7, 3, 53, 2, 3, 3, 2, 59, 2, 5, 5, 2, 3, 3, 2, 71, 2, 7, 4, 3, 3, 2, 5, 5, 3, 89, 2, 3, 3, 31, 2, 101, 101, 2, 3, 3, 2, 109, 109, 2, 113, 4, 3, 4, 11, 7, 5, 2, 3, 3, 2]

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

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