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.

A130904 Numbers n such that the trajectory of the map n -> (n + lpf(n)) / 2 reaches 3, where lpf(n) is the least prime factor of n (A020639).

Table of values

n a(n)
1 3
2 4
3 6
4 9
5 10
6 15
7 16
8 18
9 25
10 27
11 28
12 30
13 33
14 34
15 48
16 49
17 51
18 52
19 54
20 55
21 57
22 58
23 63
24 64
25 66
26 91
27 93
28 94
29 96
30 99
31 100
32 102
33 105
34 106
35 108
36 111
37 112
38 114
39 119
40 121
41 123
42 124
43 126
44 129
45 130
46 169
47 180
48 183
49 184
50 186
51 187
52 189
53 190
54 195
55 196
56 198

List of values

[3, 4, 6, 9, 10, 15, 16, 18, 25, 27, 28, 30, 33, 34, 48, 49, 51, 52, 54, 55, 57, 58, 63, 64, 66, 91, 93, 94, 96, 99, 100, 102, 105, 106, 108, 111, 112, 114, 119, 121, 123, 124, 126, 129, 130, 169, 180, 183, 184, 186, 187, 189, 190, 195, 196, 198]