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.

A348846 a(1) = 1. For n >=2 the number k in n-th position becomes a(n) only if all terms a(1)..a(n-1) have already been defined, and if the smallest number m, greater than k, not already defined and sharing greatest prime factor (gpf) p with k is reduced to m/p.

Table of values

n a(n)
1 1
2 2
3 3
4 2
5 5
6 2
7 7
8 2
9 9
10 2
11 11
12 4
13 13
14 2
15 15
16 2
17 17
18 18
19 19
20 4
21 21
22 2
23 23
24 8
25 25
26 2
27 27
28 4
29 29
30 6
31 31
32 2
33 33
34 2
35 35
36 12
37 37
38 2
39 39
40 40
41 41
42 6
43 43
44 4
45 9
46 2
47 47
48 16
49 49
50 50
51 51
52 4
53 53
54 18
55 55
56 8
57 57
58 2
59 59
60 12
61 61
62 2
63 63
64 2
65 65
66 6
67 67
68 4
69 69
70 10
71 71
72 24
73 73
74 2

List of values

[1, 2, 3, 2, 5, 2, 7, 2, 9, 2, 11, 4, 13, 2, 15, 2, 17, 18, 19, 4, 21, 2, 23, 8, 25, 2, 27, 4, 29, 6, 31, 2, 33, 2, 35, 12, 37, 2, 39, 40, 41, 6, 43, 4, 9, 2, 47, 16, 49, 50, 51, 4, 53, 18, 55, 8, 57, 2, 59, 12, 61, 2, 63, 2, 65, 6, 67, 4, 69, 10, 71, 24, 73, 2]