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.

A015909 a(n) = smallest k >= 1 such that n divides k^n + k.

Table of values

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

List of values

[1, 1, 3, 3, 5, 2, 7, 7, 9, 4, 11, 3, 13, 6, 3, 15, 17, 8, 19, 4, 21, 10, 23, 8, 25, 12, 27, 3, 29, 5, 31, 31, 33, 16, 7, 8, 37, 18, 18, 15, 41, 6, 43, 11, 45, 22, 47, 15, 49, 24, 21, 4, 53, 26, 22, 7, 57, 28, 59, 15, 61, 30, 63, 63, 65, 2, 67, 16, 69, 5, 71, 8, 73, 36, 18, 8, 77, 12, 79, 15, 81, 40, 83, 20, 15, 42, 12, 32, 89, 9, 7, 23, 93, 46, 38, 32, 97, 48, 99, 24]