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.

A374964 a(n) is the smallest positive k such that -n^n == n (mod n + k).

Table of values

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

List of values

[1, 1, 2, 1, 5, 1, 3, 1, 9, 1, 11, 1, 13, 1, 14, 1, 17, 1, 7, 1, 21, 1, 23, 1, 25, 1, 3, 1, 29, 1, 6, 1, 33, 1, 35, 1, 37, 1, 39, 1, 41, 1, 7, 1, 45, 1, 18, 1, 49, 1, 50, 1, 53, 1, 19, 1, 45, 1, 59, 1, 61, 1, 7, 1, 65, 1, 63, 1, 44, 1, 71, 1, 40, 1, 12, 1, 12, 1, 27, 1, 81, 1, 23, 1, 85, 1, 58, 1, 8, 1, 6, 1, 9]