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.

A077815 2^phi(n) mod n^2, where phi is Euler's totient function A000010.

Table of values

n a(n)
1 0
2 2
3 4
4 4
5 16
6 4
7 15
8 16
9 64
10 16
11 56
12 16
13 40
14 64
15 31
16 0
17 222
18 64
19 58
20 256
21 127
22 56
23 392
24 256
25 451
26 40
27 433
28 176
29 30
30 256
31 187
32 0
33 958
34 800
35 841
36 208
37 38
38 780
39 586
40 1536
41 944
42 568
43 1076
44 1200
45 91
46 392
47 2069
48 1024
49 2157
50 1076
51 1021
52 1600
53 1909
54 2620
55 826
56 2752

List of values

[0, 2, 4, 4, 16, 4, 15, 16, 64, 16, 56, 16, 40, 64, 31, 0, 222, 64, 58, 256, 127, 56, 392, 256, 451, 40, 433, 176, 30, 256, 187, 0, 958, 800, 841, 208, 38, 780, 586, 1536, 944, 568, 1076, 1200, 91, 392, 2069, 1024, 2157, 1076, 1021, 1600, 1909, 2620, 826, 2752]