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.

A341889 a(n) is the smallest positive integer k > 1 such that n + k divides n^n + k, or 0 if no such k exists.

Table of values

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

List of values

[2, 0, 3, 2, 3, 4, 2, 6, 3, 5, 4, 10, 2, 12, 5, 2, 3, 16, 2, 18, 3, 4, 10, 22, 3, 24, 9, 8, 6, 28, 2, 30, 7, 17, 5, 6, 2, 36, 9, 5, 3, 40, 6, 42, 3, 4, 22, 46, 2, 20, 4, 16, 7, 52, 2, 14, 3, 5, 28, 58, 2, 60, 9, 8, 3, 9, 2, 66, 11, 20, 4, 70, 3, 72, 20, 14, 3, 8, 5, 78, 4, 32, 40, 82, 2, 24, 29, 11, 3, 88, 2, 6, 7, 23]