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.

A336597 a(n) is the least number k of the form (the number of nonnegative bases m < n such that m^k == m (mod n))/(the number of nonnegative bases m < n such that -m^k == m (mod n)) dividing n, or 0 if no such k exists.

Table of values

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

List of values

[1, 1, 3, 0, 5, 3, 7, 0, 3, 5, 11, 0, 13, 7, 3, 0, 17, 3, 19, 0, 0, 11, 23, 0, 5, 13, 3, 0, 29, 3, 31, 0, 0, 17, 7, 9, 37, 19, 3, 0, 41, 0, 43, 0, 3, 23, 47, 0, 7, 5, 3, 0, 53, 3, 11, 0, 0, 29, 59, 0, 61, 31, 9, 0, 0, 0, 67, 0, 0, 7, 71, 0, 73, 37, 3, 0, 0, 3, 79, 0, 3, 41, 83, 0, 5, 43, 3, 0, 89, 3]