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.

A298268 a(1) = 1, and for any n > 1, if n is the k-th number with greatest prime factor p, then a(n) is the k-th number with least prime factor p.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 9
7 7
8 6
9 15
10 25
11 11
12 21
13 13
14 49
15 35
16 8
17 17
18 27
19 19
20 55
21 77
22 121
23 23
24 33
25 65
26 169
27 39
28 91
29 29
30 85
31 31
32 10
33 143
34 289
35 119
36 45
37 37
38 361
39 221
40 95
41 41
42 133
43 43
44 187
45 115
46 529
47 47
48 51
49 161
50 125
51 323
52 247
53 53
54 57
55 209
56 203
57 437
58 841
59 59
60 145
61 61
62 961

List of values

[1, 2, 3, 4, 5, 9, 7, 6, 15, 25, 11, 21, 13, 49, 35, 8, 17, 27, 19, 55, 77, 121, 23, 33, 65, 169, 39, 91, 29, 85, 31, 10, 143, 289, 119, 45, 37, 361, 221, 95, 41, 133, 43, 187, 115, 529, 47, 51, 161, 125, 323, 247, 53, 57, 209, 203, 437, 841, 59, 145, 61, 961]