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.

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

Table of values

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

List of values

[9, 9, 341, 121, 341, 65, 15, 21, 9, 9, 9, 33, 33, 21, 21, 15, 15, 9, 9, 9, 21, 15, 21, 33, 25, 15, 9, 9, 9, 21, 15, 15, 25, 33, 21, 9, 9, 9, 57, 39, 15, 21, 21, 21, 9, 9, 9, 65, 21, 21, 21, 15, 39, 9, 9, 9, 21, 21, 57, 145, 15, 15, 9, 9, 9, 33, 15, 33, 25, 21]

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

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