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.

A115561 a(n) = lpf((n/lpf(n))/lpf(n/lpf(n))), where lpf=A020639, least prime factor.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 3, 1, 5, 1, 1, 1, 2, 1, 1, 3, 7, 1, 5, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 7, 1, 11, 5, 1, 1, 2, 1, 5, 1, 13, 1, 3, 1, 2, 1, 1, 1, 3, 1, 1, 7, 2, 1, 11, 1, 17, 1, 7, 1, 2, 1, 1, 5, 19, 1, 13, 1, 2, 3, 1, 1, 3, 1, 1, 1, 2, 1, 3, 1, 23, 1, 1, 1, 2, 1, 7, 11, 5, 1]