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.

A079893 a(n) = gcd(n, A079892(n)), where A079892(n) is the least number > n having one more distinct prime factor than n.

Table of values

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

List of values

[1, 2, 3, 2, 1, 6, 1, 2, 1, 10, 1, 6, 1, 2, 15, 2, 1, 6, 1, 10, 3, 2, 1, 6, 1, 2, 1, 2, 1, 30, 1, 1, 3, 2, 7, 6, 1, 2, 3, 2, 1, 42, 1, 4, 15, 2, 1, 12, 1, 10, 3, 4, 1, 6, 5, 4, 3, 2, 1, 30, 1, 2, 3, 1, 1, 6, 1, 2, 1, 70, 1, 6, 1, 2, 3, 2, 1, 6, 1, 4, 1, 2, 1, 42, 5, 2, 3, 2, 1, 30, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2]