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.

A354547 Least number k <= n such that sopfr(k) = sopfr(n).

Table of values

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

List of values

[1, 2, 3, 4, 5, 5, 7, 8, 8, 7, 11, 7, 13, 14, 15, 15, 17, 15, 19, 14, 21, 13, 23, 14, 21, 26, 14, 11, 29, 21, 31, 21, 33, 19, 35, 21, 37, 38, 39, 11, 41, 35, 43, 26, 11, 46, 47, 11, 33, 35, 51, 17, 53, 11, 39, 13, 57, 31, 59, 35, 61, 62, 13, 35, 65, 39, 67, 38]