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.

A072995 Least k > 0 such that the number of solutions to x^k == 1 (mod k) 1 <= x <= k is equal to n, or 0 if no such k exists.

Table of values

n a(n)
1 1
2 4
3 9
4 8
5 25
6 18
7 49
8 16
9 27
10 50
11 121
12 36
13 169
14 98
15 225
16 32
17 289
18 54
19 361
20 110
21 147
22 242
23 529
24 72
25 125
26 338
27 81
28 196
29 841
30 0
31 961
32 64
33 1089
34 578
35 1225
36 108
37 1369
38 722
39 507
40 100
41 1681
42 0
43 1849
44 484
45 675
46 1058
47 2209
48 144
49 343
50 250
51 2601
52 1378
53 2809

List of values

[1, 4, 9, 8, 25, 18, 49, 16, 27, 50, 121, 36, 169, 98, 225, 32, 289, 54, 361, 110, 147, 242, 529, 72, 125, 338, 81, 196, 841, 0, 961, 64, 1089, 578, 1225, 108, 1369, 722, 507, 100, 1681, 0, 1849, 484, 675, 1058, 2209, 144, 343, 250, 2601, 1378, 2809]