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.

A265261 Smallest n-Knödel number, i.e., smallest composite c > n such that each b < c coprime to c satisfies b^(c-n) == 1 (mod c).

Table of values

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

List of values

[561, 4, 9, 6, 25, 8, 15, 12, 21, 12, 15, 16, 33, 24, 21, 20, 65, 24, 51, 24, 45, 24, 33, 32, 69, 30, 39, 40, 65, 36, 87, 40, 45, 44, 51, 40, 85, 56, 57, 48, 65, 72, 91, 48, 63, 66, 69, 60, 141, 56, 63, 60, 65, 72, 75, 60, 63, 70, 87, 72, 133, 122, 93, 80, 165]