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.

A373370 a(n) = gcd(bigomega(n), A064097(n)), where bigomega is number of prime factors with repetition, and A064097 is a quasi-logarithm defined inductively by a(1) = 0 and a(p) = 1 + a(p-1) if p is prime and a(n*m) = a(n) + a(m) if m,n > 1.

Table of values

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

List of values

[0, 1, 1, 2, 1, 1, 1, 3, 2, 2, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 3, 3, 1, 3, 1, 5, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 2, 1, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 4, 2, 1, 4, 2, 1, 1, 4, 1, 4, 1, 3, 1, 2, 1, 1, 1, 3, 3, 4, 1, 1, 1, 4, 3]