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.

A061026 Smallest number m such that phi(m) is divisible by n, where phi = Euler totient function A000010.

Table of values

n a(n)
1 1
2 3
3 7
4 5
5 11
6 7
7 29
8 15
9 19
10 11
11 23
12 13
13 53
14 29
15 31
16 17
17 103
18 19
19 191
20 25
21 43
22 23
23 47
24 35
25 101
26 53
27 81
28 29
29 59
30 31
31 311
32 51
33 67
34 103
35 71
36 37
37 149
38 191
39 79
40 41
41 83
42 43
43 173
44 69
45 181
46 47
47 283
48 65
49 197
50 101
51 103
52 53
53 107
54 81
55 121
56 87
57 229
58 59
59 709
60 61
61 367
62 311
63 127
64 85

List of values

[1, 3, 7, 5, 11, 7, 29, 15, 19, 11, 23, 13, 53, 29, 31, 17, 103, 19, 191, 25, 43, 23, 47, 35, 101, 53, 81, 29, 59, 31, 311, 51, 67, 103, 71, 37, 149, 191, 79, 41, 83, 43, 173, 69, 181, 47, 283, 65, 197, 101, 103, 53, 107, 81, 121, 87, 229, 59, 709, 61, 367, 311, 127, 85]