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.

A366982 a(n) is the smallest odd k > 1 such that n^((k+1)/2) == n (mod k).

Table of values

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

List of values

[3, 3, 7, 3, 3, 5, 3, 3, 7, 3, 3, 5, 3, 3, 5, 3, 3, 9, 3, 3, 5, 3, 3, 7, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 5, 3, 3, 11, 3, 3, 5, 3, 3, 5, 3, 3, 11, 3, 3, 5, 3, 3, 7, 3, 3, 5, 3, 3, 5, 3, 3, 9, 3, 3, 5, 3, 3, 13, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 5, 3, 3, 17, 3, 3]