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.

A337714 Euler totient function phi(N) divided by the multiplicative order of 3 modulo N, with N = N(n) = floor((3*n-1)/2), for n >= 1.

Table of values

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

List of values

[1, 1, 1, 1, 1, 2, 1, 2, 4, 1, 2, 1, 1, 2, 2, 2, 1, 4, 2, 1, 1, 2, 1, 2, 2, 1, 4, 5, 1, 2, 2, 2, 1, 1, 4, 1, 2, 4, 1, 2, 6, 1, 2, 4, 3, 2, 2, 2, 6, 2, 2, 2, 1, 8, 5, 2, 4, 1, 4, 1, 12, 2, 2, 2, 2, 1, 2, 1, 3, 8, 1, 2, 4, 2, 4, 1]