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.

A356167 Greatest common divisor of A003961(n) and the smallest positive k such that n divides k*A003961(k), where A003961 is fully multiplicative with a(p) = nextprime(p).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 5, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 5, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 7, 1, 1, 1, 1, 3, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 1, 1, 1, 3, 11, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 5]