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.

A332334 Let a(1) = a(2) = 1, and for n > 2 let a(n) = p where p is the largest prime such that p# divides phi(n), where phi is Euler's totient function and # is the primorial.

Table of values

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

List of values

[1, 1, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 3, 2, 2, 2, 3, 3, 2, 3, 2, 2, 2, 2, 3, 3, 3, 2, 2, 5, 2, 2, 2, 3, 3, 3, 3, 3, 2, 2, 3, 3, 2, 3, 2, 2, 2, 3, 2, 2, 3, 2, 3, 2, 3, 3, 2, 2, 2, 5, 5, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 3, 3, 2, 3, 5, 3, 3, 2, 3, 2, 2, 3, 2, 3, 2]

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

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