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.

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

Table of values

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

List of values

[0, 4, 7, 2, 4, 5, 13, 2, 7, 4, 19, 2, 4, 23, 2, 5, 2, 13, 4, 31, 2, 3, 2, 17, 37, 2, 19, 4, 43, 2, 4, 47, 2, 7, 2, 5, 53, 2, 5, 2, 4, 29, 61, 2, 3, 2, 4, 67, 2, 4, 5, 73, 2, 3, 2, 4, 79, 2, 4, 83, 2, 5, 2, 43, 89, 2, 7, 2, 3, 2, 47, 97]

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

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