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.

A126762 a(n) is the least k > n such that the remainder when n^k is divided by k is n.

Table of values

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

List of values

[2, 3, 5, 5, 7, 7, 11, 9, 11, 11, 13, 13, 17, 15, 17, 17, 19, 19, 23, 21, 23, 23, 29, 25, 28, 27, 29, 29, 31, 31, 37, 33, 37, 35, 37, 37, 41, 39, 41, 41, 43, 43, 47, 45, 47, 47, 53, 49, 53, 51, 53, 53, 59, 55, 59, 57, 59, 59, 61, 61, 67, 63, 67, 65, 67, 67, 71, 69, 71, 71, 73, 73]