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.

A184829 a(n) = smallest k such that A000961(n+1) = A000961(n) + (A000961(n) mod k), or 0 if no such k exists.

Table of values

n a(n)
1 2
2 0
3 2
4 3
5 3
6 2
7 7
8 7
9 3
10 5
11 3
12 3
13 5
14 3
15 23
16 5
17 3
18 2
19 9
20 11
21 3
22 13
23 3
24 5
25 47
26 3
27 29
28 61
29 7
30 3
31 67
32 7
33 79
34 7
35 9
36 31
37 3
38 9
39 3
40 5
41 15
42 9
43 3
44 2
45 5
46 25
47 3
48 43
49 3
50 29
51 151
52 53
53 3
54 5
55 167
56 3
57 19
58 3
59 7
60 3
61 17
62 199
63 73
64 3
65 5
66 227
67 3
68 239
69 47
70 6
71 3
72 251
73 257
74 3
75 53
76 7
77 3
78 277
79 5

List of values

[2, 0, 2, 3, 3, 2, 7, 7, 3, 5, 3, 3, 5, 3, 23, 5, 3, 2, 9, 11, 3, 13, 3, 5, 47, 3, 29, 61, 7, 3, 67, 7, 79, 7, 9, 31, 3, 9, 3, 5, 15, 9, 3, 2, 5, 25, 3, 43, 3, 29, 151, 53, 3, 5, 167, 3, 19, 3, 7, 3, 17, 199, 73, 3, 5, 227, 3, 239, 47, 6, 3, 251, 257, 3, 53, 7, 3, 277, 5]

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

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