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.

A066340 Fermat's triangle: T(n,m) = m^phi(n) mod n; n >= 2; 1 <= m <= n-1, where phi is Euler's totient function.

Table of values

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

List of values

[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 4, 3, 4, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 6, 1, 6, 5, 6, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 9, 4, 1, 0, 1, 4, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 8, 1, 8, 7, 8, 1, 8, 1, 8, 1, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1, 1]