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.

A353916 a(1) = 1, a(2) = 2. Let j = a(n-1) and let m = omega(gcd(j, k)) with gcd(j, k) > 1. For n > 2, a(n) = least k such that min(omega(j), omega(k)) = m and m < max(omega(j), omega(k)).

Table of values

n a(n)
1 1
2 2
3 6
4 3
5 12
6 4
7 10
8 5
9 15
10 9
11 18
12 8
13 14
14 7
15 21
16 27
17 24
18 16
19 20
20 25
21 30
22 32
23 22
24 11
25 33
26 66
27 36
28 42
29 28
30 49
31 35
32 70
33 40
34 60
35 45
36 81
37 39
38 13
39 26
40 64
41 34
42 17
43 51
44 102
45 48
46 78
47 52
48 128
49 38
50 19
51 57
52 114
53 54
54 84
55 56
56 126
57 63
58 105
59 75
60 90
61 50
62 110
63 44
64 121
65 55
66 125

List of values

[1, 2, 6, 3, 12, 4, 10, 5, 15, 9, 18, 8, 14, 7, 21, 27, 24, 16, 20, 25, 30, 32, 22, 11, 33, 66, 36, 42, 28, 49, 35, 70, 40, 60, 45, 81, 39, 13, 26, 64, 34, 17, 51, 102, 48, 78, 52, 128, 38, 19, 57, 114, 54, 84, 56, 126, 63, 105, 75, 90, 50, 110, 44, 121, 55, 125]