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.

A331283 a(n) = gcd(n, A329605(n)), where A329605(n) gives the number of divisors of primorial inflation of n, A108951(n).

Table of values

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

List of values

[1, 2, 1, 1, 1, 6, 1, 4, 9, 2, 1, 4, 1, 2, 3, 1, 1, 6, 1, 4, 3, 2, 1, 2, 1, 2, 1, 4, 1, 6, 1, 2, 3, 2, 1, 3, 1, 2, 3, 20, 1, 6, 1, 4, 1, 2, 1, 12, 1, 2, 3, 4, 1, 2, 1, 8, 3, 2, 1, 30, 1, 2, 1, 1, 1, 6, 1, 4, 3, 2, 1, 18, 1, 2, 3, 4, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 3, 8, 1, 10, 1, 4, 3, 2, 1, 2, 1, 2, 1, 5, 1, 6, 1, 8, 3]