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.

A196499 Numbers k such that the greatest residue of the congruence x^k (mod k) equals k-1 for x in [0..k-1].

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 7
6 9
7 10
8 11
9 13
10 15
11 17
12 19
13 21
14 23
15 25
16 26
17 27
18 29
19 31
20 33
21 34
22 35
23 37
24 39
25 41
26 43
27 45
28 47
29 49
30 50
31 51
32 53
33 55
34 57
35 58
36 59
37 61
38 63
39 65
40 67
41 69
42 71
43 73
44 74
45 75
46 77
47 79
48 81
49 82
50 83
51 85
52 87
53 89
54 91
55 93
56 95
57 97
58 99
59 101
60 103
61 105
62 106
63 107
64 109
65 111

List of values

[1, 2, 3, 5, 7, 9, 10, 11, 13, 15, 17, 19, 21, 23, 25, 26, 27, 29, 31, 33, 34, 35, 37, 39, 41, 43, 45, 47, 49, 50, 51, 53, 55, 57, 58, 59, 61, 63, 65, 67, 69, 71, 73, 74, 75, 77, 79, 81, 82, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 106, 107, 109, 111]

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

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