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.

A378640 Smallest m such that phi(m) does not divide n, where phi is the Euler totient function (A000010).

Table of values

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

List of values

[3, 5, 3, 7, 3, 5, 3, 7, 3, 5, 3, 11, 3, 5, 3, 7, 3, 5, 3, 7, 3, 5, 3, 11, 3, 5, 3, 7, 3, 5, 3, 7, 3, 5, 3, 11, 3, 5, 3, 7, 3, 5, 3, 7, 3, 5, 3, 11, 3, 5, 3, 7, 3, 5, 3, 7, 3, 5, 3, 15, 3, 5, 3, 7, 3, 5, 3, 7, 3, 5, 3, 11, 3, 5, 3, 7, 3, 5, 3, 7, 3, 5, 3, 11, 3, 5]