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.

A337925 Digits of n rearranged to be the smallest number with the fewest possible prime factors, counted with multiplicity. Terms retain the same number of digits as n, i.e. leading digits may not be zero.

Table of values

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

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 21, 13, 41, 15, 61, 17, 18, 19, 20, 21, 22, 23, 42, 25, 26, 27, 82, 29, 30, 13, 23, 33, 43, 53, 63, 37, 83, 39, 40, 41, 42, 43, 44, 45, 46, 47, 84, 49, 50, 15, 25, 53, 45, 55, 65, 57, 58, 59, 60, 61, 26, 63, 46, 65, 66, 67, 86, 69, 70, 17, 27, 37, 47, 57, 67, 77]