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.

A378637 Largest m <= n such that phi(m) divides n, where phi is the Euler totient function (A000010).

Table of values

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

List of values

[1, 2, 2, 4, 2, 6, 2, 8, 2, 6, 2, 12, 2, 6, 2, 16, 2, 18, 2, 12, 2, 6, 2, 24, 2, 6, 2, 12, 2, 22, 2, 32, 2, 6, 2, 36, 2, 6, 2, 33, 2, 18, 2, 23, 2, 6, 2, 48, 2, 22, 2, 12, 2, 54, 2, 30, 2, 6, 2, 50, 2, 6, 2, 64, 2, 46, 2, 12, 2, 22, 2, 72, 2, 6, 2, 12, 2, 18, 2, 75]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.