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.

A353917 a(1) = 4. Let j = a(n-1) and let m = omega(gcd(j, k)) with gcd(j, k) > 1. For n > 1, a(n) = least k such that min(omega(j), omega(k)) = m and m < max(omega(j), omega(k)), but neither j | k nor k | j.

Table of values

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

List of values

[4, 6, 8, 10, 16, 12, 9, 15, 25, 20, 30, 18, 27, 21, 49, 14, 32, 22, 64, 24, 42, 28, 70, 40, 60, 36, 66, 44, 110, 50, 90, 48, 78, 52, 128, 26, 169, 39, 81, 33, 121, 55, 125, 35, 343, 56, 84, 54, 102, 68, 170, 80, 120, 45, 105, 63, 168, 72, 114, 76, 190, 100, 130]